Abstract is missing.
- Hunting Redundancies in StringsGolnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore. 1-14 [doi]
- Some Remarks on Automata MinimalityAntonio Restivo, Roberto Vaglica. 15-27 [doi]
- Growth Properties of Power-Free LanguagesArseny M. Shur. 28-43 [doi]
- A Functional Program for Regular Expressions Matching - Abstract of Invited TalkThomas Wilke. 44-45 [doi]
- State Complexity Research and ApproximationSheng Yu, Yuan Gao. 46-57 [doi]
- Counting the Orderings for Multisets in Consecutive Ones Property and PQ-TreesGiovanni Battaglia, Roberto Grossi, Noemi Scutellà. 58-69 [doi]
- Avoiding Abelian Powers in Partial WordsFrancine Blanchet-Sadri, Sean Simmons. 70-81 [doi]
- Regular Splicing Languages Must Have a ConstantPaola Bonizzoni, Natasha Jonoska. 82-92 [doi]
- The Average Transition Complexity of Glushkov and Partial Derivative AutomataSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 93-104 [doi]
- Theory of ÁtomataJanusz A. Brzozowski, Hellis Tamm. 105-116 [doi]
- Syntactic Complexity of Ideal and Closed LanguagesJanusz A. Brzozowski, Yuli Ye. 117-128 [doi]
- Generalized One-UnambiguityPascal Caron, Yo-Sub Han, Ludovic Mignot. 129-140 [doi]
- Simulations over Two-Dimensional On-Line Tessellation AutomataGérard Cécé, Alain Giorgetti. 141-152 [doi]
- Δ-Clearing Restarting Automata and CFL /makebox{/sf CFL}Peter Cerno, Frantisek Mráz. 153-164 [doi]
- Enumeration and Decidable Properties of Automatic SequencesEmilie Charlier, Narad Rampersad, Jeffrey Shallit. 165-179 [doi]
- Languages vs. ::::ω::::-Languages in Regular Infinite GamesNamit Chaturvedi, Jörg Olschewski, Wolfgang Thomas. 180-191 [doi]
- Solving Word Problems in Group Extensions over Infinite WordsVolker Diekert, Alexei G. Myasnikov. 192-203 [doi]
- Abelian Primitive WordsMichael Domaratzki, Narad Rampersad. 204-215 [doi]
- On Prefix Normal WordsGabriele Fici, Zsuzsanna Lipták. 228-238 [doi]
- On Non-complete Sets and Restivo s ConjectureVladimir V. Gusev, Elena V. Pribavkina. 239-250 [doi]
- Self-organization in Cellular Automata: A Particle-Based ApproachBenjamin Hellouin de Menibus, Mathieu Sablik. 251-263 [doi]
- Chop Operations and Expressions: Descriptional Complexity ConsiderationsMarkus Holzer, Sebastian Jakobi. 264-275 [doi]
- Nodes Connected by Path LanguagesMarkus Holzer, Martin Kutrib, Ursula Leiter. 276-287 [doi]
- Characterizing the Regular Languages by Nonforgetting Restarting AutomataNorbert Hundeshagen, Friedrich Otto. 288-299 [doi]
- On Two-Way TransducersOscar H. Ibarra, Hsu-Chun Yen. 300-311 [doi]
- There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free LanguagesJuha Kortelainen, Tuukka Salmi. 312-323 [doi]
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation SemigroupsMichal Kunc, Alexander Okhotin. 324-336 [doi]
- Deciding Networks of Evolutionary ProcessorsFlorin Manea. 337-349 [doi]
- From Linear Partitions to Parallelogram PolyominoesRoberto Mantaci, Paolo Massazza. 350-361 [doi]
- On Brzozowski s Conjecture for the Free Burnside Semigroup Satisfying ::::x:::::::2::: = ::::x:::::::3:::Andrey N. Plyushchenko, Arseny M. Shur. 362-373 [doi]
- Never Minimal Automata and the Rainbow Bipartite Subgraph ProblemEmanuele Rodaro, Pedro V. Silva. 374-385 [doi]
- Boolean Algebras of Regular LanguagesVictor L. Selivanov, Anton Konovalov. 386-396 [doi]
- Infinite Words Rich and Almost Rich in Generalized PalindromesEdita Pelantová, Stepán Starosta. 406-416 [doi]
- Models of Pushdown Automata with ResetNuri Tasdemir, A. C. Cem Say. 417-428 [doi]
- Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept LatticesRyo Yoshinaka. 429-440 [doi]
- On Highly Repetitive and Power Free WordsNarad Rampersad, Elise Vaslet. 441-451 [doi]
- A Sufficient Condition for Erasing Productions to Be AvoidableGeorg Zetzsche. 452-463 [doi]
- Encoding Centered Polyominoes by Means of a Regular LanguageDaniela Battaglino, Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi. 464-465 [doi]
- Computational Aspects of Asynchronous Cellular AutomataJérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni. 466-468 [doi]
- Short 3-Collapsing Words over a 2-Letter AlphabetAlessandra Cherubini, Achille Frigeri, Brunetto Piochi. 469-471 [doi]
- A Cascade Decomposition of Weighted Finite Transition SystemsManfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic. 472-473 [doi]
- Morphic Characterizations in Terms of Insertion Systems with a Context of Length OneKaoru Fujioka. 474-475 [doi]
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive DataAnna Kasprzik. 476-477 [doi]
- On the Representability of Line GraphsSergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson. 478-479 [doi]