Automata Implementation Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers
The papers contained in this volume were presented at the third international Workshop on Implementing Automata, held September 17{19,1998, at the U- versity of Rouen, France. Automata theory is the cornerstone of computer science theory. While there is much practical experience with using automata,...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1999, 1999
|
| Edition: | 1st ed. 1999 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
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
- Autographe: A Graphical Version of Automate
- INTEX 4.1 for Windows: A Walkthrough