Abstract is missing.
- Streamable Fragments of Forward XPathOlivier Gauwin, Joachim Niehren. 3-15 [doi]
- Gaining Power by Input Operations: Finite Automata and BeyondMarkus Holzer, Martin Kutrib. 16-29 [doi]
- Weak Inclusion for XML TypesJoshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty. 30-41 [doi]
- Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued LanguagesDenis Béchet, Alexandre Ja. Dikovsky, Annie Foret. 42-52 [doi]
- Bouma2 - A High-Performance Input-Aware Multiple String-Match AlgorithmErez Buchnik. 53-64 [doi]
- Random Generation of Deterministic Acyclic Automata Using Markov ChainsVincent Carnino, Sven De Felice. 65-75 [doi]
- Variable and Clause Ordering in an FSA Approach to Propositional SatisfiabilityJosé M. Castaño, Rodrigo Castaño. 76-87 [doi]
- Nondeterministic Moore Automata and Brzozowski s AlgorithmGiusi Castiglione, Antonio Restivo, Marinella Sciortino. 88-99 [doi]
- Building Phylogeny with Minimal Absent WordsSupaporn Chairungsee, Maxime Crochemore. 100-109 [doi]
- On the Hardness of Priority SynthesisChih-Hong Cheng, Barbara Jobstmann, Christian Buckl, Alois Knoll. 110-117 [doi]
- Smaller Representation of Finite State AutomataJan Daciuk, Dawid Weiss. 118-129 [doi]
- Compositional Failure Detection in Structured Transition SystemsIngo Felscher, Wolfgang Thomas. 130-141 [doi]
- Chrobak Normal Form Revisited, with ApplicationsPawel Gawrychowski. 142-153 [doi]
- A Cellular Automaton Model for Car Traffic with a Form-One-Lane RuleYo-Sub Han, Sang-Ki Ko. 154-165 [doi]
- Loops and Overloops for Tree Walking AutomataPierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. 166-177 [doi]
- Nondeterministic State Complexity of Star-Free LanguagesMarkus Holzer, Martin Kutrib, Katja Meckel. 178-189 [doi]
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGsOscar H. Ibarra. 190-202 [doi]
- Computing All ℓ-Cover Automata FastArtur Jez, Andreas Maletti. 203-214 [doi]
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State MachinesNatalia Kushik, Khaled El-Fakih, Nina Yevtushenko. 215-224 [doi]
- Towards More Expressive 2D Deterministic AutomataVioletta Lonati, Matteo Pradella. 225-237 [doi]
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian AutomataPavel Martyugin. 238-249 [doi]
- Distributed Event Clock Automata - Extended AbstractJames Jerson Ortiz, Axel Legay, Pierre Yves Schobbens. 250-263 [doi]
- Fly-Automata, Their Properties and ApplicationsBruno Courcelle, Irène Durand. 264-272 [doi]
- Tree Template Matching in Ranked Ordered Trees by Pushdown AutomataTomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis. 273-281 [doi]
- Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers ApproachVesna Pajic, Gordana Pavlovic-Lazetic, Milos Pajic. 282-289 [doi]
- Experimental Study of the Shortest Reset Word of Random AutomataEvgeny Skvortsov, Evgeny Tipikin. 290-298 [doi]