Abstract is missing.
- Special factors in some combinational structuresArturo Carpi, Aldo de Luca, Stefano Varricchio. 3-13
- Subword complexity and periodicity in two or more dimensionsJulien Cassaigne. 14-21
- On the decomposition of finite languagesArto Salomaa, Sheng Yu. 22-31
- Computation = self-assembly + conformational change: toward new computing paradigmsTakashi Yokomori. 32-43
- Asynchronous sliding block mapsMarie-Pierre Béal, Olivier Carton. 47-59
- Bisimulations and behaviour of nondeterministic automataCristian Calude, Elena Calude. 60-70
- Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automataPetr Jiricka, Jaroslav Král. 71-80
- Functions preserving classes of languagesPavel Kveton, Václav Koubek. 81-102
- Restarting automata, Church-Rosser languages, and representations of r.e. languagesGundula Niemann, Friedrich Otto. 103-114
- Weak cyclic forms of rw-automataMartin Plátek. 115-124
- Exponential ambiguity of context-free grammarsKlaus Wich. 125-138
- A non-ambiguous language factorization problemMarcella Anselmo. 141-152
- Decidability of code propertiesHenning Fernau, Klaus Reinhardt, Ludwig Staiger. 153-163
- Defect theorems for treesJuhani Karhumäki, Sabrina Mantaci. 164-177
- On the complexity of computing the order of repetition of a stringJuhani Karhumäki, Wojciech Plandowski. 178-184
- New problems of pattern avoidanceJohn Loftus, Jeffrey Shallit, Ming-wei Wang. 185-199
- Substitutions from Rauzy induction (extended abstract)Luis-Miguel Lopez, Philippe Narbel. 200-209
- Characterization of a word by its subwordsJán Manuch. 210-219
- On semilinearity in formal power seriesIon Petre. 220-231
- Right and left strongly locally testable semigroups and languagesJosé Ruiz, Pedro García. 232-241
- On decidability of boundedness property for regular path queriesYves Andre, Francis Bossut, Anne-Cécile Caron. 245-256
- Bidirectional parsing for linear languagesStefan Andrei, Manfred Kudlek. 257-269
- Caterpillars, context, tree automata and tree pattern matchingAnne Brüggemann-Klein, Derick Wood. 270-285
- Yakyak: parsing with logical side constraintsNils Klarlund, Niels Damgaard, Michael I. Schwartzbach. 286-301
- Cooperating distributed grammar systems with non-terminating componentsHenning Bordihn, Markus Holzer. 305-315
- On tally languages and generalized interacting automataThomas Buchholz, Andreas Klein, Martin Kutrib. 316-325
- Table-driven and context-sensitive collage languagesFrank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski. 326-337
- Test tube systems: when two tubes are enoughRudolf Freund, Franziska Freund. 338-350
- On fixed and general membership for external and internal contextual languagesMarkus Holzer. 351-361
- Contextual grammars with trajectoriesCarlos Martín-Vide, Alexandru Mateescu. 362-374
- Slender matrix languagesRalf Stiebe. 375-385