Front matter
1-23
Edit-Distance of Weighted Automata
Mehryar Mohri
303-358
p
-Subsequentiable Transducers
Cyril Allauzen and Mehryar Mohri
401-434
Bidirectional Push Down Automata
Miguel A. Alonso, Víctor J. Díaz and Manuel Vilares
71-86
Finite Automata and Non-self-Embedding Grammars
Marcella Anselmo, Dora Giammarresi and Stefano Varricchio
141-208
Simulation of Gate Circuits in the Algebra of Transients
Janusz Brzozowski and Mihaela Gheorghiu
105-125
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata
Cezar Cămpeanu and Andrei Păun
77-84
Regex and Extended Regex
Cezar Câmpeanu, Kai Salomaa and Sheng Yu
225-237
Prime Decompositions of Regular Prefix Codes
Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc and Wojciech Rytter
303-328
Implementation of Dictionaries via Automata and Decision Trees
Abolfazl Fatholahzadeh
11-18
Feedback-Free Circuits in the Algebra of Transients
Mihaela Gheorghiu and Janusz Brzozowski
359-400
On Minimizing Cover Automata for Finite Languages in
O
(
n
log
n
) Time
Heiko Körner
128-137
Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers
Jorge Graña, Gloria Andrade and Jesús Vilares
245-275
Finite State Lazy Operations in NLP
Franck Guingne and Florent Nicart
61-79
State Complexity of Basic Operations on Nondeterministic Finite Automata
Markus Holzer and Martin Kutrib
1-46
Adaptive Automata - A Revisited Proposal
João José Neto and César Bravo
287-294
Efficient Automaton-Based Recognition for Linear Conjunctive Languages
Alexander Okhotin
1-12
Syntactic Semiring and Language Equations
Libor Polák
194-202
Reduced Power Automata
Klaus Sutner
27-48
A Polynomial Time Algorithm for Left [Right] Local Testability
A.N. Trahtman
127-140
Whale Calf, a Parser Generator for Conjunctive Grammars
Alexander Okhotin
305-312
automata, a Hybrid System for Computational Automata Theory
Klaus Sutner
265-272
A Package TESTAS for Checking Some Kinds of Testability
A. N. Trahtman
229-244
DAWG versus Suffix Array
Miroslav Balík
277-303
On Predictive Parsing and Extended Context-Free Grammars
Anne Brüggemann-Klein and Derick Wood
103-125
Star Normal Form, Rational Expressions, and Glushkov WFAs Properties
Pascal Caron and Marianne Flouret
127-152
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings
Jan Daciuk
339-343
Term Validation of Distributed Hard Real-Time Applications
Gaëlle Largeteau and Dominique Geniet
153-161
Common Subsequence Automaton
Zdenêk Troniĉek
21-36
Searching for Asymptotic Error Repair
Manuel Vilares, Victor M. Darriba and Miguel A. Alonso
47-57
Automata-Based Representations for Arithmetic Constraints in Automated Verification
Constantinos Bartzis and Tev.k Bultan
7-9
On the Implementation of Compact DAWG’s
Jan Holub and Maxime Crochemore
199-223
Dynamic Programming — NFA Simulation
Jan Holub
137-151
Deterministic Parsing of Cyclic Strings
Bořivoj Melichar
Back matter