Abstract is missing.
- Hierarchies of language families of contextual grammarsBianca Truthe. 13-28
- Non-classical Turing machines: extending the notion of computationJirí Wiedermann, Jan van Leeuwen. 29-40
- Minimality problems for promise versions of finite automataMichal Ajdarów. 41-55
- Inhabitation machines: determinism and principalitySandra Alves, Sabine Broda. 57-70
- An extension of the LR parsing algorithm for two-head pushdown automataDávid Angyal, Benedek Nagy. 71-86
- State complexity of distinguishability combined with union operationCezar Câmpeanu. 87-101
- Self-verifying pushdown automataHenning Fernau, Martin Kutrib, Matthias Wendlandt. 103-117
- Regular grammars for array languagesHenning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas. 119-134
- Two-sided strictly locally testable languagesMarkus Holzer 0001, Martin Kutrib, Friedrich Otto. 135-150
- Star-complement-star and Kuratowski algebras on prefix-free languagesGalina Jirásková, Matús Palmovský. 151-164
- Decidability questions for insertion systemsAndreas Malcher. 165-180
- On shrinking restarting automataFriedrich Otto. 181-195
- Non-self-embedding grammars and descriptional complexityGiovanni Pighizzini, Luca Prigioniero. 197-209
- Analysis by reduction of analytical PDT-treesMartin Plátek, Karel Oliva, Dana Pardubská. 211-226
- On the expressive power of weighted restarting automataQichao Wang. 227-241
- A recursive definition of quantum polynomial time computability (extended abstract)Tomoyuki Yamakami. 243-258