Abstract is missing.
- Tree-Walking AutomataMikolaj Bojanczyk. 1-2 [doi]
- Formal Language Tools for Template-Guided DNA RecombinationMichael Domaratzki. 3-5 [doi]
- Subsequence Counting, Matrix Representations and a Theorem of EilenbergBenjamin Steinberg. 6-10 [doi]
- Synchronizing Automata and the Cerny ConjectureMikhail V. Volkov. 11-27 [doi]
- About Universal Hybrid Networks of Evolutionary Processors of Small SizeArtiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin. 28-39 [doi]
- On Bifix Systems and GeneralizationsJan-Henrik Altenbernd. 40-51 [doi]
- Finite Automata, Palindromes, Powers, and PatternsTerry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey Shallit. 52-63 [doi]
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded ConfigurationsPablo Arrighi, Vincent Nesme, Reinhard Werner. 64-75 [doi]
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious ReductionsDorothea Baumeister, Jörg Rothe. 76-87 [doi]
- Optional and Iterated Types for Pregroup GrammarsDenis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel. 88-100 [doi]
- Transformations and Preservation of Self-assembly Dynamics through HomothetiesFlorent Becker. 101-112 [doi]
- Deterministic Input-Reversal and Input-Revolving Finite AutomataSuna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib. 113-124 [doi]
- Random Context in Regulated Rewriting VersusCooperating Distributed Grammar SystemsHenning Bordihn, Markus Holzer. 125-136 [doi]
- Extending the Overlap Graph for Gene Assembly in CiliatesRobert Brijder, Hendrik Jan Hoogeboom. 137-148 [doi]
- Automatic Presentations for Cancellative SemigroupsAlan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas. 149-159 [doi]
- Induced Subshifts and Cellular AutomataSilvio Capobianco. 160-171 [doi]
- Hopcroft s Algorithm and Cyclic AutomataGiusi Castiglione, Antonio Restivo, Marinella Sciortino. 172-183 [doi]
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDsJérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. 184-195 [doi]
- Consensual Definition of Languages by Regular SetsStefano Crespi-Reghizzi, Pierluigi San Pietro. 196-208 [doi]
- k-Petri Net Controlled GrammarsJürgen Dassow, Sherzod Turaev. 209-220 [doi]
- 2-Synchronizing WordsPawel Gawrychowski, Andrzej Kisielewicz. 221-231 [doi]
- Not So Many Runs in StringsMathieu Giraud. 232-239 [doi]
- A Hybrid Approach to Word Segmentation of Vietnamese TextsLê Hông Phuong, Nguyên Thi Minh Huyên, Azim Roussanaly, Hô Tuòng Vinh. 240-249 [doi]
- On Linear Logic Planning and ConcurrencyOzan Kahramanogullari. 250-262 [doi]
- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)Laura Kallmeyer, Yannick Parmentier. 263-274 [doi]
- Anti-pattern Matching ModuloClaude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. 275-286 [doi]
- Counting Ordered Patterns in Words Generated by MorphismsSergey Kitaev, Toufik Mansour, Patrice Séébold. 287-298 [doi]
- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent GroupsOndrej Klíma, Libor Polák. 299-310 [doi]
- Characterization of Star-Connected Languages Using Finite AutomataBarbara Klunder. 311-320 [doi]
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite SystemsMartin Korp, Aart Middeldorp. 321-332 [doi]
- Further Results on Insertion-Deletion Systems with One-Sided ContextsAlexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan. 333-344 [doi]
- On Regularity-Preservation by String-Rewriting SystemsPeter Leupold. 345-356 [doi]
- Minimizing Deterministic Weighted Tree AutomataAndreas Maletti. 357-372 [doi]
- Lower Bounds for Generalized Quantum Finite AutomataMark Mercer. 373-384 [doi]
- How Many Figure Sets Are Codes?Malgorzata Moczurad, Wlodzimierz Moczurad. 385-396 [doi]
- On Alternating Phrase-Structure GrammarsEtsuro Moriya, Friedrich Otto. 397-408 [doi]
- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-AutomataFriedrich Otto, Martin Plátek. 409-420 [doi]
- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-HardAlexander Perekrestenko. 421-432 [doi]
- Sorting and Element Distinctness on One-Way Turing MachinesHolger Petersen. 433-439 [doi]
- On Periodicity of Generalized Two-Dimensional WordsSvetlana Puzynina. 440-451 [doi]
- On the Analysis of Simple 2D Stochastic Cellular AutomataDamien Regnault, Nicolas Schabanel, Eric Thierry. 452-463 [doi]
- Polycyclic and Bicyclic Valence AutomataElaine Render, Mark Kambites. 464-475 [doi]
- Length Codes, Products of Languages and PrimalityArto Salomaa, Kai Salomaa, Sheng Yu. 476-486 [doi]
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAsRyo Yoshinaka. 487-498 [doi]