Abstract is missing.
- Electronic Voting: How Logic Can HelpVéronique Cortier. [doi]
- Timed and Untimed Energy GamesKim Guldstrand Larsen. [doi]
- CoInductive Automata AlgorithmsDamien Pous. [doi]
- On the Complexity of Determinizing MonitorsLuca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Sævar Örn Kjartansson. 1-13 [doi]
- On the Semantics of Atomic Subgroups in Practical Regular ExpressionsMartin Berglund, Brink van der Merwe, Bruce Watson, Nicolaas Weideman. 14-26 [doi]
- On the Regularity and Learnability of Ordered DAG LanguagesHenrik Björklund, Johanna Björklund, Petter Ericson. 27-39 [doi]
- On the Number of Active States in Deterministic and Nondeterministic Finite AutomataHenning Bordihn, Markus Holzer 0001. 40-51 [doi]
- Complexity of Proper Prefix-Convex Regular LanguagesJanusz A. Brzozowski, Corwin Sinnamon. 52-63 [doi]
- Equivalence of Probabilistic \mu -Calculus and p-AutomataClaudia Cauli, Nir Piterman. 64-75 [doi]
- Complexity of Bifix-Free Regular LanguagesRobert Ferens, Marek Szykula. 76-88 [doi]
- Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion SystemsHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. 89-100 [doi]
- Stamina: Stabilisation Monoids in Automata TheoryNathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg. 101-112 [doi]
- A Simple Method for Building Bimachines from Functional Finite-State TransducersStefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz. 113-125 [doi]
- Alignment Distance of Regular Tree LanguagesYo-Sub Han, Sang-Ki Ko. 126-137 [doi]
- Nondeterministic Complexity of Operations on Free and Convex LanguagesMichal Hospodár, Galina Jirásková, Peter Mlynárcik. 138-150 [doi]
- Transducing Reversibly with Finite State MachinesMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 151-162 [doi]
- From Hadamard Expressions to Weighted Rotating Automata and BackLouis-Marie Dando, Sylvain Lombardy. 163-174 [doi]
- RCMPaolo Massazza. 175-187 [doi]
- Synchronization Problems in Automata Without Non-trivial CyclesAndrew Ryzhikov. 188-200 [doi]
- Syntactic Complexity of Bifix-Free LanguagesMarek Szykula, John Wittnebel. 201-212 [doi]