Abstract is missing.
- Implementation and Application of Automata in String ProcessingGonzalo Navarro. 1 [doi]
- Applications of Automata in XML ProcessingChristoph Koch. 2 [doi]
- Program Analysis through Finite Tree AutomataHelmut Seidl. 3 [doi]
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic AutomatonMarkus Holzer, Andreas Maletti. 4-13 [doi]
- On Extremal Cases of Hopcroft s AlgorithmGiusi Castiglione, Antonio Restivo, Marinella Sciortino. 14-23 [doi]
- Compact Normal Form for Regular Languages as Xor AutomataJean Vuillemin, Nicolas Gama. 24-33 [doi]
- Cellular Automata with Sparse CommunicationMartin Kutrib, Andreas Malcher. 34-43 [doi]
- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop RuleAdam Clarridge, Kai Salomaa. 44-53 [doi]
- On Parallel Implementations of Deterministic Finite AutomataJan Holub, Stanislav Stekr. 54-64 [doi]
- FAdo and GUItarAndré Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis. 65-74 [doi]
- A Testing Framework for Finite-State MorphologyFrançois Barthélemy. 75-83 [doi]
- A Table Compression Method for Extended Aho-Corasick AutomatonYanbing Liu, Yifu Yang, Ping Liu, Jianlong Tan. 84-93 [doi]
- Compact Representation for Answer Sets of n-ary Regular QueriesKazuhiro Inaba, Haruo Hosoya. 94-104 [doi]
- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree AutomataAkio Fujiyoshi. 105-114 [doi]
- Random Generation of Deterministic Tree (Walking) AutomataPierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. 115-124 [doi]
- Hedge Pattern Partial DerivativeTaro Suzuki, Satoshi Okui. 125-134 [doi]
- TAGED Approximations for Temporal Properties Model-CheckingRoméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. 135-144 [doi]
- Verifying Parallel Programs with Dynamic Communication StructuresMohamed Faouzi Atig, Tayssir Touili. 145-154 [doi]
- Fixpoint Guided Abstraction Refinement for Alternating AutomataPierre Ganty, Nicolas Maquet, Jean-François Raskin. 155-164 [doi]
- Automata-Based Termination ProofsRadu Iosif, Adam Rogalewicz. 165-177 [doi]
- Implementation of State Elimination Using HeuristicsJae-Hee Ahn, Yo-Sub Han. 178-187 [doi]
- Short Regular Expressions from Finite Automata: Empirical ResultsHermann Gruber, Markus Holzer, Michael Tautschnig. 188-197 [doi]
- Small Extended Expressions for Acyclic AutomataPascal Caron, Jean-Marc Champarnaud, Ludovic Mignot. 198-207 [doi]
- Quantum Queries on Permutations with a PromiseRusins Freivalds, Kazuo Iwama. 208-216 [doi]
- Time-Optimal Winning Strategies for Poset GamesMartin Zimmermann 0002. 217-226 [doi]
- Amount of Nonconstructivity in Finite AutomataRusins Freivalds. 227-236 [doi]
- Multiflex: A Multilingual Finite-State Tool for Multi-Word UnitsAgata Savary. 237-240 [doi]
- Efficient Parsing Using Filtered-Popping Recursive Transition NetworksJavier M. Sastre-MartÃnez. 241-244 [doi]
- Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree AlgorithmsLoek G. Cleophas, Kees Hemerik. 245-248 [doi]
- Formally Synthesising a Protocol Converter: A Case StudyJing Cao, Albert Nymeyer. 249-252 [doi]
- Compiler Generator Based on Restarting AutomataJan Procházka. 253-257 [doi]
- Are Statecharts Finite Automata?Hanlin Lu, Sheng Yu. 258-261 [doi]