Automata implementation : third International Workshop on Implementing Automata, WIA'98, Rouen, France, Septem
Author: International Workshop on Implementing Automata (3rd : 1998 : Rouen, France), Champarnaud, Jean-Marc, Maurel, Denis, Ziadi, Djelloul
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Machine theory, syntaxe langage, langage formel, linguistique informatique, automate, Automates mathématiques, Théorie des, Automatentheorie, Abstracte automaten, Linguagens formais e automatos, Automat, Berechenbarkeit, Formale Sprache, Kongress, Programmierung, Formale Sprache, Kongress, Programmierung, automate, langage formel, linguistique informatique, syntaxe langage, Automat, Automatentheorie, Berechenbarkeit, Formale Sprache, Programmierung
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540666524, 9783540666523
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 111.53 MB
PDF Size: 5.34 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 467
Views: 517
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 09:45:07
Size: 8.47 KB
Description
Author: Jean-Marc Champarnaud, Djelloul Ziadi, Denis Maurel
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66652-3
DOI: 10.1007/3-540-48057-9
Table of Contents:
- Extended Context-Free Grammars and Normal Form Algorithms
- On Parsing LL-Languages
- On Parsing and Condensing Substrings of LR Languages in Linear Time
- Minimal Cover-Automata for Finite Languages
- Determinization of Glushkov Automata
- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
- Operations on DASG
- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
- The Syntactic Prediction with Token Automata: Application to HandiAS System
- Bi-directional Automata to Extract Complex Phrases from Texts
- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
- Using Acceptors as Transducers
- Proving Sequential Function Chart Programs Using Automata
- Automata and Computational Probabilities
- Automata and Binary Decision Diagrams
- Operations over Automata with Multiplicities
- Paging Automata
- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment
- The Finite State Automata’s Design Patterns
- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
Includes bibliographical references and index
Extended context-free grammars and normal form algorithms / Jürgen Albert, Dora Giammarresi, Derick Wood -- On parsing LL-languages / Norbert Blum -- On parsing and condensing substrings of LR languages in linear time / Heiko Goeman -- Minimal cover-automata for finite languages / Cezar Câmpeanu, Nicolae Sântean, Sheng Yu -- Determinization of Glushkov automata / Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty -- Implementing reversed alternating finite automaton (r-AFA) operations / Sandra Huerter [and others] -- Operations on DASG / Zdeněk Tronìček -- Implementation of nondeterministic finite automata for approximate pattern matching / Jan Holub, Bořivoj Melichar -- The syntactic prediction with token automata : application to HandiAS system / Denis Maurel, Brigitte Le Pévédic, Olivier Rousseau -- Bi-directional automata to extract complex phrases from texts / Thierry Poibeau -- A fast new semi-incremental algorithm for the construction of minimal acyclic DFAs / Bruce W. Watson -- Using acceptors as transducers / Matti Nykänen -- Proving sequential function chart programs using automata / Dominique L'Her, Philippe Le Parc, Lionel Marcé -- Automata and computational probabilities / Marie-Chantal Beaulieu, Anne Bergeron -- Automata and binary decision diagrams / Jean-Francis Michon, Jean-Marc Champarnaud -- Operations over automata with multiplicities / Gérard Duchamp, Marianne Flouret, Éric Laugerotte -- Paging automata / Ricardo Ueda Karpischek -- On the syntax, semantics, and implementation of a graph-based computational environment / Yuri Velinov -- The finite state automata's design patterns / Sandra Pedrazzini -- Automata to recognize finite and infinite words with at least two factorizations on a given finite set / Xavier Augros --Autographe : a graphical version of Automate / Are Uppman, Jean-Marc Champarnaud -- INTEX 4.1 for Windows : a walkthrough / Max Silberztein