Abstract is missing.
- In Memoriam Sheng YuYuan Gao, Kai Salomaa. 1-4 [doi]
- In Search of Most Complex Regular LanguagesJanusz A. Brzozowski. 5-24 [doi]
- A Formal Framework for Processes Inspired by the Functioning of Living CellsAndrzej Ehrenfeucht, Grzegorz Rozenberg. 25-27 [doi]
- Adding Pebbles to Weighted AutomataPaul Gastin, Benjamin Monmege. 28-51 [doi]
- Typed Linear Algebra for Weigthed (Probabilistic) AutomataJosé Nuno Oliveira. 52-65 [doi]
- A Pushdown Transducer Extension for the OpenFst LibraryCyril Allauzen, Michael Riley. 66-77 [doi]
- Weak Inclusion for Recursive XML TypesJoshua Amavi, Jacques Chabin, Pierre Réty. 78-89 [doi]
- Synchronizing Automata on Quasi-Eulerian DigraphMikhail V. Berlinkov. 90-100 [doi]
- Cellular Automata on Regular Rooted TreesTullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Zoran Sunic. 101-112 [doi]
- Strict Local Testability with Consensus Equals RegularityStefano Crespi-Reghizzi, Pierluigi San Pietro. 113-124 [doi]
- Nominal Automata for Resource Usage ControlPierpaolo Degano, Gian Luigi Ferrari, Gianluca Mezzetti. 125-137 [doi]
- Weighted Nested Word Automata and Logics over Strong BimonoidsManfred Droste, Bundit Pibaljommee. 138-148 [doi]
- A Fast Suffix Automata Based Algorithm for Exact Online String MatchingSimone Faro, Thierry Lecroq. 149-158 [doi]
- P(l)aying for SynchronizationFedor M. Fominykh, Mikhail V. Volkov. 159-170 [doi]
- Synchronizing Automata of Bounded RankVladimir V. Gusev. 171-179 [doi]
- Automatic Theorem-Proving in Combinatorics on WordsDaniel Goc, Dane Henshall, Jeffrey Shallit. 180-191 [doi]
- How to Synchronize the Heads of a Multitape AutomatonOscar H. Ibarra, Nicholas Q. Trân. 192-204 [doi]
- Regular Ideal Languages and Their Boolean CombinationsFranz Jahn, Manfred Kufleitner, Alexander Lauser. 205-216 [doi]
- Hyper-minimization for Deterministic Tree AutomataArtur Jez, Andreas Maletti. 217-228 [doi]
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAsGalina Jirásková, Tomás Masopust. 229-239 [doi]
- Implementing Computations in Automaton (Semi)groupsInes Klimann, Jean Mairesse, Matthieu Picantin. 240-252 [doi]
- On the Descriptional Complexity of the Window Size for Deterministic Restarting AutomataMartin Kutrib, Friedrich Otto. 253-264 [doi]
- A Disambiguation Algorithm for Finite Automata and Functional TransducersMehryar Mohri. 265-277 [doi]
- Synchronization of Automata with One Undefined or Ambiguous TransitionPavel V. Martyugin. 278-288 [doi]
- Restarting Tiling AutomataDaniel Prusa, Frantisek Mráz. 289-300 [doi]
- 1-ClausesAndreas Reuß, Helmut Seidl. 301-312 [doi]
- Factor and Subsequence Kernels and Signatures of Rational LanguagesAhmed Amarni, Sylvain Lombardy. 313-320 [doi]
- Multi-Tilde-Bar DerivativesPascal Caron, Jean-Marc Champarnaud, Ludovic Mignot. 321-328 [doi]
- On Positive TAGED with a Bounded Number of ConstraintsPierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. 329-336 [doi]
- SDFA: Series DFA for Memory-Efficient Regular Expression MatchingTingwen Liu, Yong Sun, Li Guo, Binxing Fang. 337-344 [doi]
- The Removal of Weighted ε-TransitionsSylvain Lombardy, Jacques Sakarovitch. 345-352 [doi]
- Weighted LTL with DiscountingEleni Mandrali. 353-360 [doi]
- Automata with Modulo Counters and Nondeterministic Counter BoundsDaniel Reidenbach, Markus L. Schmid. 361-368 [doi]