Abstract is missing.
- Hyper-Minimizing Minimized Deterministic AutomataViliam Geffert, Andrew Badr, Ian Shipman. 9-30
- Compressed membership problems revisitedMarkus Lohrey. 31-53
- Mathematics of gene assembly in ciliates (Abstract)Ion Petre. 54-55
- The sequentialisation of automata and transducers (Abstract)Jacques Sakarovitch. 56-57
- Semigroups of regular languages over a one letter alphabet are rationalSergey Afonin, Elena Khazova. 61-73
- Continuous LanguagesThomas Ang, Janusz A. Brzozowski. 74-85
- Simulation equivalence of automata and circuitsMiklós Bartha. 86-99
- Counting of a family of column-convex rectilinear tilesChristiane Bercoff. 100-110
- NP-completeness of the alphabetical satisfiability problem for trace equationsLuca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro. 111-121
- Counting Distinct Squares in Partial WordsFrancine Blanchet-Sadri, Robert Mercas, Geoffrey Scott. 122-133
- Computing Weak Periods of Partial WordsFrancine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin. 134-145
- Non-Linear Subband Coding with Cellular AutomataCarlos Cruz-Reyes, Jarkko Kari. 146-157
- Subregularly Tree Controlled Grammars and LanguagesJürgen Dassow, Bianca Truthe. 158-169
- A Kleene Theorem for Binoid LanguagesZsolt Gazdag, Zoltán L. Németh. 170-182
- Homomorphisms Preserving Types of DensityHelmut Jürgensen, Ian McQuillan. 183-194
- Extending finite-memory automata with non-deterministic reassignment (Extended abstract)Michael Kaminski, Daniel Zeitlin. 195-207
- Monocultures in eco-grammar systemsAlica Kelemenová, Tomás Bartík. 208-219
- Literally idempotent languages and their varieties - two letter caseOndrej Klíma, Libor Polák. 220-231
- Automata associated with open conjugated systemsMiklós Krész. 232-244
- Euler paths and ends in automatic and recursive graphsDietrich Kuske, Markus Lohrey. 245-256
- On Stateless Two-Pushdown Automata and Restarting AutomataMartin Kutrib, Hartmut Messerschmidt, Friedrich Otto. 257-268
- Boolean grammars and gsm mappingsTommi Lehtinen, Alexander Okhotin. 269-280
- How to Pop a Deep PDA MattersPeter Leupold. 281-291
- Sublinearly Space Bounded Iterative ArraysAndreas Malcher, Carlo Mereghetti, Beatrice Palano. 292-301
- Some Remarks on the Hairpin CompletionFlorin Manea, Victor Mitrana, Takashi Yokomori. 302-313
- Complexity of problems concerning reset words for commutative automata and automata with simple idempotentsPavel V. Martyugin. 314-324
- On Pure Multi-Pushdown Automata that Perform Complete-Pushdown PopsTomás Masopust, Alexander Meduna. 325-336
- Kleene revisited by SuschkewitschJean Marcel Pallo. 337-348
- Membrane Computing: Recent Developments and Applications (Extended Abstract)Gheorghe Paun. 350-351
- Cellular Wave Computers - Algorithms for million processor computers (Abstract)Tamás Roska. 352
- In silico Evolutionary Developmental Neurobiology and the Origin of Natural Language (Abstract)Eörs Szathmáry. 353