Front matter
1-12
Extended Context-Free Grammars and Normal Form Algorithms
Jürgen Albert, Dora Giammaressi and Derick Wood
13-21
On Parsing
LL
-Languages
Norbert Blum
22-42
On Parsing and Condensing Substrings of LR Languages in Linear Time
Heiko Goeman
43-56
Minimal Cover-Automata for Finite Languages
Cezar Câmpeanu, Nicolae Sântean and Sheng Yu
57-68
Determinization of Glushkov Automata
Jean-Marc Champarnaud, Djelloul Ziadi and Jean-Luc Ponty
69-81
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
Sandra Huerter, Kai Salomaa, Xiuming Wu and Sheng Yu
82-91
Operations on DASG
Zdeněk Tronìček
92-99
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
Jan Holub and Bořivoj Melichar
100-109
The Syntactic Prediction with Token Automata: Application to HandiAS System
Denis Maurel, Brigitte Le Pévédic and Olivier Rousseau
110-120
Bi-directional Automata to Extract Complex Phrases from Texts
Thierry Poibeau
121-132
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
Bruce W. Watson
133-148
Using Acceptors as Transducers
Matti Nykänen
149-163
Proving Sequential Function Chart Programs Using Automata
Dominique L’Her, Philippe Le Parc and Lionel Marcé
164-177
Automata and Computational Probabilities
Marie-Chantal Beaulieu and Anne Bergeron
178-182
Automata and Binary Decision Diagrams
Jean-Francis Michon and Jean-Marc Champarnaud
183-191
Operations over Automata with Multiplicities
Gérard Duchamp, Marianne Flouret and Éric Laugerotte
192-198
Paging Automata
Ricardo Ueda Karpischek
199-212
On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment
Yuri Velinov
213-219
The Finite State Automata’s Design Patterns
Sandro Pedrazzini
220-225
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
Xavier Augros
226-229
Autographe: A Graphical Version of Automate
Are Uppman and Jean-Marc Champarnaud
230-243
INTEX 4.1 for Windows: A Walkthrough
Max Silberztein
Back matter