Abstract is missing.
- Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational ComplexityMarkus Holzer, Martin Kutrib. 1-16 [doi]
- Language Decompositions, Primality, and Trajectory-Based OperationsKai Salomaa. 17-22 [doi]
- Automata, Probability, and RecursionMihalis Yannakakis. 23-32 [doi]
- Concurrency, Synchronization, and Conflicts in Petri NetsHsu-Chun Yen. 33-35 [doi]
- Automated Compositional Reasoning of Intuitionistically Closed Regular PropertiesYih-Kuen Tsay, Bow-Yaw Wang. 36-45 [doi]
- Antimirov and Mosses s Rewrite System RevisitedMarco Almeida, Nelma Moreira, Rogério Reis. 46-56 [doi]
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree AutomataAhmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar. 57-67 [doi]
- Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)Jean-Marc Champarnaud, Jean-Philippe Dubernard, H. Jeanne. 68-77 [doi]
- Hopcroft s Minimization Technique: Queues or Stacks?Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón. 78-91 [doi]
- Learning Regular Languages Using Nondeterministic Finite AutomataPedro García, Manuel Vazquez de Parga, Gloria Alvarez, José Ruiz. 92-101 [doi]
- Multi-Return Macro Tree TransducersKazuhiro Inaba, Haruo Hosoya, Sebastian Maneth. 102-111 [doi]
- Computing Convex Hulls by Automata IterationFrançois Cantin, Axel Legay, Pierre Wolper. 112-121 [doi]
- A Translation from the HTML DTD into a Regular Hedge GrammarTakuya Nishiyama, Yasuhiko Minamide. 122-131 [doi]
- Tree-Series-to-Tree-Series TransformationsAndreas Maletti. 132-140 [doi]
- Automata-Theoretic Analysis of Bit-Split Languages for Packet ScanningRyan Dixon, Ömer Egecioglu, Timothy Sherwood. 141-150 [doi]
- Pattern Matching in DCA Coded TextJan Lahoda, Borivoj Melichar, Jan Zdárek. 151-160 [doi]
- Five Determinisation AlgorithmsRob J. van Glabbeek, Bas Ploeger. 161-170 [doi]
- Persistent Computations of Turing MachinesHarald Hempel, Madlen Kimmritz. 171-180 [doi]
- On Complexity of Two Dimensional Languages Generated by TransducersEgor Dolzhenko, Natasa Jonoska. 181-190 [doi]
- Games for Temporal Logics on TreesZoltán Ésik, Szabolcs Iván. 191-200 [doi]
- A Run-Time Efficient Implementation of Compressed Pattern Matching AutomataTetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda. 201-211 [doi]
- Composed Bisimulation for Tree AutomataParosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar. 212-222 [doi]
- Hyper-Minimization in O(n2)Andrew Badr. 223-231 [doi]
- Deterministic Pushdown Automata and Unary LanguagesGiovanni Pighizzini. 232-241 [doi]
- Finite Eilenberg MachinesBenoît Razet. 242-251 [doi]
- The Number of Runs in Sturmian WordsPawel Baturo, Marcin Piatkowski, Wojciech Rytter. 252-261 [doi]
- 3-Way Composition of Weighted Finite-State TransducersCyril Allauzen, Mehryar Mohri. 262-273 [doi]
- Progressive Solutions to FSM EquationsKhaled El-Fakih, Nina Yevtushenko. 274-282 [doi]
- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked TreesAkio Fujiyoshi. 283-285 [doi]
- Approximate Periods with Levenshtein DistanceMartin Simunek, Borivoj Melichar. 286-287 [doi]