Abstract is missing.
- On Some Decision Problems on Quantum AutomataFlavio D'Alessandro, Carlo Mereghetti, Beatrice Palano, Paolo Papi. 3-17 [doi]
- Scattered Factor Universality - A SurveyPamela Fleischmann. 18-24 [doi]
- Seventy Years of Algebraic, Logical, and Topological Methods for Regular LanguagesJean-Éric Pin. 25-40 [doi]
- Thue-Morse Series and k-ary PartitionsMehdi Golafshan, Michel Rigo. 43-56 [doi]
- Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure Under Self-assemblyKatalin Anna Lázár, Florin Manea, Stefan Siemer, Timo Specht. 57-71 [doi]
- Reversible Weighted Automata over Finite Rings and Monoids with Commuting IdempotentsPeter Kostolányi, Andrej Ravinger. 72-87 [doi]
- Generalized Wheeler Automata: MinimalityNicola Cotumaccio. 88-102 [doi]
- Visibly Pushdown Languages in GroupsLaura Ciobanu, Daniel Turaev. 103-116 [doi]
- Centered Ascending PolyominoesP. Massazza, Simone Rinaldi, Lama Tarsissi. 117-129 [doi]
- The Joker Game Only Characterizes History-Determinism in Parity Automata With up to Two PrioritiesDorian Guyot, Ulrich Ultes-Nitsche. 130-138 [doi]
- Context-Free, Conjunctive and Boolean Grammars and SCYK AutomataEtienne Grandjean, Théo Grente, Véronique Terrier. 139-152 [doi]
- Minimizing Streaming String Transducers: An Algebraic ApproachYahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier. 153-167 [doi]
- Closure Operations on Picture Languages and Their Relation to Floor PlansStefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro. 168-180 [doi]
- Complexity of Linear Subsequences of Fibonacci-Automatic SequencesDelaram Moradi, Narad Rampersad, Jeffrey O. Shallit. 181-193 [doi]
- Visibly Recursive AutomataKévin Dubrulle, Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet. 194-208 [doi]
- On Languages Describing Large Graph ClassesHenning Fernau, Pamela Fleischmann, Kevin Mann, Silas Cato Sacher. 209-222 [doi]
- Efficient Computation of Discriminative Absent Words for String CollectionsGiuseppa Castigione, Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Marinella Sciortino. 223-237 [doi]
- Passive Learning of Symbolic Automata over Monotonic AlgebrasPeter Habermehl, Erwann Loulergue. 238-251 [doi]
- Transformations between Minimally f-free WordsMarcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci. 252-265 [doi]
- Small Abelian Complexity of Multidimensional WordsOlga Karmanova, Svetlana Puzynina. 266-279 [doi]
- Tree Representations of Infinite Words and Their Logical PropertiesArnaud Carayol, Lucien Charamond. 280-292 [doi]
- The Four Corners Problem Over Larger AlphabetsDaniel Prusa, Michael Wehar, Chen Xu. 293-306 [doi]
- On the Descriptional Complexity of Literal ShuffleGuilherme Duarte 0001, Nelma Moreira, Luca Prigioniero, Rogério Reis. 307-320 [doi]
- On Word Representations and Embeddings in Complex MatricesPaul C. Bell, George Kenison, Reino Niskanen, Igor Potapov, Pavel Semukhin. 321-334 [doi]
- Generation and Enumeration of Floorplans Determined by HV-MatricesAndrea Frosini, Shin-Ichi Nakano, Simone Rinaldi. 335-348 [doi]