Abstract is missing.
- Languages Recognizable by Quantum Finite AutomataRusins Freivalds. 1-14 [doi]
- The Language, the Expression, and the (Small) AutomatonJacques Sakarovitch. 15-30 [doi]
- Minimization of Non-deterministic Automata with Large AlphabetsParosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson. 31-42 [doi]
- Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata Marcella Anselmo, Maria Madonia. 43-53 [doi]
- Component Composition Preserving Behavioural Contracts Based on Communication TracesArnaud Bailly, Mireille Clerbout, Isabelle Simplot-Ryl. 54-65 [doi]
- Strong Retiming Equivalence of Synchronous SchemesMiklós Bartha. 66-77 [doi]
- Prime Normal Form and Equivalence of Simple GrammarsCédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. 78-89 [doi]
- An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover AutomataCezar Câmpeanu, Andrei Paun, Jason R. Smith. 90-103 [doi]
- Finite Automata and Unions of Regular Patterns with Bounded Constant SegmentsAntonio Cano, Pedro Garcia. 104-115 [doi]
- Inside VaucansonThomas Claveirole, Sylvain Lombardy, Sarah O Connor, Louis-Noël Pouchet, Jacques Sakarovitch. 116-128 [doi]
- Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree AutomatonAkio Fujiyoshi, Ikuo Kawaharada. 129-140 [doi]
- Shorter Regular Expressions from Finite-State AutomataYo-Sub Han, Derick Wood. 141-152 [doi]
- Wind in the Willows - Generating Music by Means of Tree TransducersJohanna Högberg. 153-162 [doi]
- On Deterministic Catalytic SystemsOscar H. Ibarra, Hsu-Chun Yen. 163-175 [doi]
- Restricting the Use of Auxiliary Symbols for Restarting AutomataTomasz Jurdzinski, Friedrich Otto. 176-187 [doi]
- A Class of Rational ::::n::::-WFSM Auto-intersectionsAndré Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart. 188-198 [doi]
- Experiments with Deterministic omega-Automata for Formulas of Linear Temporal LogicJoachim Klein, Christel Baier. 199-212 [doi]
- Computing Affine Hulls over Q and Z from Sets Represented by Number Decision DiagramsLouis Latour. 213-224 [doi]
- Tree Automata and XPath on Compressed TreesMarkus Lohrey, Sebastian Maneth. 225-237 [doi]
- Deeper Connections Between LTL and Alternating AutomataRadek Pelánek, Jan Strejcek. 238-249 [doi]
- The Structure of Subword Graphs and Suffix Trees of Fibonacci WordsWojciech Rytter. 250-261 [doi]
- Observations on Determinization of Büchi AutomataChristoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier. 262-272 [doi]
- The Interval Rank of Monotonic AutomataTamara Shcherbak. 273-281 [doi]
- Compressing XML Documents Using Recursive Finite State AutomataHariharan Subramanian, Priti Shankar. 282-293 [doi]
- Non-backtracking Top-Down Algorithm for Checking Tree Automata ContainmentTadahiro Suda, Haruo Hosoya. 294-306 [doi]
- Size Reduction of Multitape AutomataHellis Tamm, Matti Nykänen, Esko Ukkonen. 307-318 [doi]
- Robust Spelling CorrectionManuel Vilares Ferro, Juan Otero Pombo, Jesús Vilares Ferro. 319-328 [doi]
- On Two-Dimensional Pattern Matching by Finite AutomataJan Zdárek, Borivoj Melichar. 329-340 [doi]
- Incremental and Semi-incremental Construction of Pseudo-Minimal AutomataJan Daciuk, Denis Maurel, Agata Savary. 341-342 [doi]
- Is Learning RFSAs Better Than Learning DFAs?Pedro García, José Ruiz, Antonio Cano, Gloria Alvarez. 343-344 [doi]
- Learning Stochastic Finite Automata for Musical Style RecognitionColin de la Higuera, Frédéric Piat, Frédéric Tantini. 345-346 [doi]
- Simulation of Soliton CircuitsMiklós Krész. 347-348 [doi]
- Acyclic Automata with Easy-to-Find Short Regular ExpressionsJosé João Morais, Nelma Moreira, Rogério Reis. 349-350 [doi]
- On the Equivalence Problem for Programs with Mode SwitchingRimma I. Podlovchenko, Dmitry M. Rusakov, Vladimir A. Zakharov. 351-352 [doi]
- Automata and AB-Categorial GrammarsIsabelle Tellier. 353-355 [doi]
- On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State SetMichael Vielhaber, Mónica del Pilar Canales Chacon. 356-357 [doi]