Abstract is missing.
- P Automata: Automata-like constructs modeling complex natural systemsErzsébet Csuhaj-Varjú. 13-30
- Input-driven pushdown automata: nondeterminism and unambiguityAlexander Okhotin, Kai Salomaa. 31-33
- Graph-transformational swarmsLarbi Abdenebaoui, Hans-Jörg Kreowski, Sabine Kuske. 35-50
- Programming language specification by a grammar with contextsMikhail Barash. 51-67
- A note on the complexity of deterministic tree-walking transducersHenrik Björklund, Petter Ericson. 69-83
- Grammatical inference of lambda-confluent context rewriting systemsPeter Cerno. 85-100
- The support of nested weighted automataManfred Droste, Doreen Götze. 101-116
- Two-dimensional pattern languagesHenning Fernau, Markus L. Schmid, K. G. Subramanian. 117-132
- Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completenessRudolf Freund, Marion Oswald. 133-150
- One-way simulation of two-way finite automata over small alphabetsViliam Geffert, Alexander Okhotin. 151-162
- Power of S-kR-RRWW-automataPetr Hoffmann. 163-178
- Minimization and characterizations for biautomataMarkus Holzer, Sebastian Jakobi. 179-193
- Deterministic one-way Turing machines with sublinear space boundsMartin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt. 195-208
- Limited automata and context-free languagesGiovanni Pighizzini, Andrea Pisoni. 209-223
- Computationally complete chains of evolutionary processors with random context filtersBianca Truthe. 225-241
- Asynchronous systems of parallel communicating finite automataMarcel Vollweiler. 243-257