Abstract is missing.
- Quantum Finite AutomataAndris Ambainis. 9-13
- An Alternating Hierarchy for Finite AutomataViliam Geffert. 15-36
- k-Counting AutomataUlrich Ultes-Nitsche, Joël Allred. 37-50
- Molecular Switching by Turing AutomataMiklós Bartha, Miklós Krész. 51-71
- Regularity of Languages Defined by Formal Series with Isolated Cut PointAlberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro. 73-87
- Normal Forms for Unary Probabilistic AutomataMaria Paola Bianchi, Giovanni Pighizzini. 89-102
- On the Expressiveness of Parikh Automata and Related ModelsMichaël Cadilhac, Alain Finkel, Pierre McKenzie. 103-119
- Generating Networks of Splicing ProcessorsJürgen Dassow, Florin Manea, Bianca Truthe. 121-136
- A Cascade Decomposition of Weighted Finite Transition SystemsManfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic. 137-152
- On BiautomataOndrej Klíma, Libor Polák. 153-164
- On the Power of Randomization for One-Way Finite AutomataRichard Královic. 165-177
- String Assembling SystemsMartin Kutrib, Matthias Wendlandt. 179-192
- Pushdown Automata with Translucent Pushdown SymbolsBenedek Nagy, Friedrich Otto, Marcel Vollweiler. 193-208
- Superiority of One-Way and Realtime Quantum Machines and New DirectionsAbuzer Yakaryilmaz. 209-224