Abstract is missing.
- Equations: From Words to Graph ProductsVolker Diekert. 1-6
- Pushdown automata with cancellation and commutation-augmented pregroups grammarsNissim Francez, Michael Kaminski. 7-26
- SynchronizationHelmut Jürgensen. 27-48
- Classical Simulation Complexity of Quantum Branching ProgramsFarid M. Ablayev, Aida Gainutdinova. 49-56
- Application of suffix trees for the acquisition of common motifs with gaps in a set of stringsPavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo. 57-66
- SI! Automata Can Show PSPACE Results for Description LogicsFranz Baader, Jan Hladik, Rafael Peñaloza. 67-78
- Occurrence and Lexicographic Properties of Standard Sturmian WordsPawel Baturo, Wojciech Rytter. 79-90
- An Approach to Parallel Mildly Context-Sensitive Grammar FormalismsSuna Bensch. 91-102
- Universality for Nondeterministic LogspaceVinay Choudhary, Anand Kumar Sinha, Somenath Biswas. 103-114
- Fine and Wilf's Periodicity Result on Partial Words and ConsequencesFrancine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg. 115-126
- Geometrical LanguagesBaptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard. 127-138
- A Characterization of Flip-accessibility for Rhombus Tilings of the Whole PlaneOlivier Bodini, Thomas Fernique, Eric Rémila. 139-150
- The Number of Convex PermutominoesPaolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini. 151-162
- Muller Message-Passing Automata and LogicsBenedikt Bollig, Dietrich Kuske. 163-174
- Deterministically and Sudoku-Deterministically Recognizable Picture LanguagesBernd Borchert, Klaus Reinhardt. 175-186
- On leftmost derivations in CD grammar systemsHenning Bordihn, György Vaszil. 187-198
- Practical block sequence alignment with movesJulien Bourdaillet, Jean-Gabriel Ganascia. 199-210
- Computational Complexity of Dynamical Systems: the case of Cellular AutomataPietro di Lena, Luciano Margara. 211-222
- On the syllabification of words via go-through automataLiviu Petrisor Dinu, Radu Gramatovici, Florin Manea. 223-236
- Automata Networks without any Letichevsky CriteriaPál Dömösi. 237-248
- Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying ApproachJürgen Dassow, Henning Fernau. 249-260
- Computational Complexity of NFA Minimization for Finite and Unary LanguagesHermann Gruber, Markus Holzer. 261-272
- Generalizations of One-Deterministic Regular LanguagesYo-Sub Han, Derick Wood. 273-284
- Weighted Degenerated Approximate Pattern MatchingCostas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol. 285-296
- Reductions of matrices associated with nowhere-zero flowsMartin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková. 297-306
- First-order deduction in neural networksEkaterina Komendantskaya. 307-318
- Nondeterministic soliton automata with a single external vertexMiklós Krész. 319-330
- Fast Reversible Language Recognition Using Cellular AutomataMartin Kutrib, Andreas Malcher. 331-342
- Succinct Description of Regular Languages by Weak Restarting AutomataMartin Kutrib, Jens Reimann. 343-354
- State Complexity of Basic Operations Combined with ReversalGuangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu. 355-366
- The submonoid and rational subset membership problems for graph groupsMarkus Lohrey, Benjamin Steinberg. 367-378
- Compositions of Extended Top-down Tree TransducersAndreas Maletti. 379-390
- A series of slowly synchronizable automata with a zero state over a small alphabetPavel V. Martugin. 391-402
- Descriptional Complexity of Grammars Regulated by Context ConditionsTomás Masopust, Alexander Meduna. 403-412
- On Determinism Versus Non-Determinism for Restarting AutomataHartmut Messerschmidt, Friedrich Otto. 413-424
- Free Word-Order and Restarting AutomataFrantisek Mráz, Friedrich Otto, Martin Plátek. 425-436
- Locally Stratified Boolean GrammarsChristos Nomikos, Panos Rondogiannis. 437-448
- On the Regularity of Binoid Languages: A Comparative ApproachZoltán L. Németh. 449-460
- Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family AnnotationKazuya Ogasawara, Satoshi Kobayashi. 461-472
- Unambiguous Boolean grammarsAlexander Okhotin. 473-484
- Verification of Succinct Hierarchical State MachinesSalvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato. 485-496
- Topology-based Geometric Modelling for Biological Cellular ProcessesMathieu Poudret, Jean-Paul Comet, Pascale Le Gall, Agnès Arnould, Philippe Meseure. 497-508
- Descriptive Complexity of the Hamming Neighborhood of a Regular LanguageGrigoriy Povarov. 509-520
- Networks of Evolutionary Processors with Two Nodes Are UnpredictableArtiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin. 521-528
- Classifying omega-regular partitionsVictor L. Selivanov. 529-540
- On Star-Free Trace Languages and their Lexicographic RepresentationsKrystyna Stawikowska, Edward Ochmanski. 541-552
- Slender Siromoney Matrix LanguagesRalf Stiebe. 553-564
- Model Checking Buechi SpecificationsDeian Tabakov, Moshe Y. Vardi. 565-576
- Categorial Module Grammars of Bounded Size have Finite Bounded DensityCamilo Thorne. 577-588
- Rule-based Word Spacing in Korean Based on Lexical Information Extracted from a CorpusJuntae Yoon, Gil-Young Song, Seonho Kim. 589-599