Automata Implementation Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers /
Automata Implementation Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers / [electronic resource] :
edited by Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi.
- 1st ed. 1999.
- X, 250 p. online resource.
- Lecture Notes in Computer Science, 1660 1611-3349 ; .
- Lecture Notes in Computer Science, 1660 .
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 -- Autographe: A Graphical Version of Automate -- INTEX 4.1 for Windows: A Walkthrough.
The papers contained in this volume were presented at the third international Workshop on Implementing Automata, held September 17
9783540480570
10.1007/3-540-48057-9 doi
Artificial intelligence.
Mathematical logic.
Compilers (Computer programs).
Computer science.
Machine theory.
Logic design.
Artificial Intelligence.
Mathematical Logic and Foundations.
Compilers and Interpreters.
Theory of Computation.
Formal Languages and Automata Theory.
Logic Design.
Q334-342 TA347.A78
006.3
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 -- Autographe: A Graphical Version of Automate -- INTEX 4.1 for Windows: A Walkthrough.
The papers contained in this volume were presented at the third international Workshop on Implementing Automata, held September 17
9783540480570
10.1007/3-540-48057-9 doi
Artificial intelligence.
Mathematical logic.
Compilers (Computer programs).
Computer science.
Machine theory.
Logic design.
Artificial Intelligence.
Mathematical Logic and Foundations.
Compilers and Interpreters.
Theory of Computation.
Formal Languages and Automata Theory.
Logic Design.
Q334-342 TA347.A78
006.3