Abstract is missing.
- On nondeterministic two-way transducersBruno Guillon. 11-27
- On the application of Watson-Crick finite automata for the resolution of bioinformatic problemsJosé M. Sempere. 29-30
- Causal dynamics of discrete manifoldsPablo Arrighi, Clément Chouteau, Stefano Facchini, Simon Martiel. 31-47
- On regular expressions with backreferences and transducersMartin Berglund, Frank Drewes, Brink van der Merwe. 49-64
- Postselecting probabilistic finite state recognizers and verifiersMaksims Dimitrijevs, Abuzer Yakaryilmaz. 65-81
- Automata that may change their mindMarkus Holzer 0001, Martin Kutrib. 83-98
- Forbidden patterns for ordered automataOndrej Klíma 0001, Libor Polák. 99-115
- A jumping 5' → 3' Watson-Crick finite automata modelRadim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna. 117-132
- Two-sided locally testable languagesMartin Kutrib, Friedrich Otto. 133-148
- Characterizations of LRR-languages by correctness-preserving computationsFrantisek Mráz, Friedrich Otto, Martin Plátek. 149-164
- Networks of evolutionary processors with resources restricted filtersBianca Truthe. 165-180
- Jumping restarting automataQichao Wang, Yongming Li 0001. 181-196
- One-way topological automata and the tantalizing effects of their topological featuresTomoyuki Yamakami. 197-214