Abstract is missing.
- The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture LanguagesStefano Crespi-Reghizzi. 1-14 [doi]
- Ranking Binary Unlabelled Necklaces in Polynomial TimeDuncan Adamson. 15-29 [doi]
- On the Power of Recursive Word-Functions Without ConcatenationJérôme Durand-Lose. 30-42 [doi]
- Clusters of Repetition Roots Forming Prefix ChainsSzilárd Zsolt Fazekas, Robert Mercas. 43-56 [doi]
- Nearly k-Universal Words - Investigating a Part of Simon's CongruencePamela Fleischmann, Lukas Haschke, Annika Huch, Annika Mayrock, Dirk Nowotka. 57-71 [doi]
- State Complexity of Binary Coded Regular LanguagesViliam Geffert, Dominika Palisínová, Alexander Szabari. 72-84 [doi]
- Reset Complexity and Completely Reachable Automata with Simple IdempotentsStefan Hoffmann 0001. 85-99 [doi]
- On the Descriptional Complexity of the Direct Product of Finite AutomataMarkus Holzer 0001, Christian Rauch. 100-111 [doi]
- Operations on Subregular Languages and Nondeterministic State ComplexityMichal Hospodár, Peter Mlynárcik, Viktor Olejar. 112-126 [doi]
- On Simon's Congruence Closure of a StringSungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa. 127-141 [doi]
- Approximate NFA Universality Motivated by Information TheoryStavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis. 142-154 [doi]
- Lazy Regular SensingOrna Kupferman, Asaf Petruschka. 155-169 [doi]
- State Complexity of Finite Partial LanguagesMartin Kutrib, Matthias Wendlandt. 170-183 [doi]
- Yet Another Canonical Nondeterministic AutomatonHendrik Maarand, Hellis Tamm. 184-196 [doi]
- Union-Complexities of Kleene Plus OperationBenedek Nagy. 197-211 [doi]