Abstract is missing.
- On Language Varieties Without Boolean OperationsFabian Birkmann, Stefan Milius, Henning Urbat. 3-15 [doi]
- Partially Directed Animals with a Bounded Number of HolesValentina Dorigatti, Paolo Massazza. 16-28 [doi]
- 2 MonoidManasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan. 29-40 [doi]
- Location Based Automata for Expressions with ShuffleSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 43-54 [doi]
- Succinct Representations for (Non)Deterministic Finite AutomataSankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti. 55-67 [doi]
- Optimising Attractor Computation in Boolean Automata NetworksKévin Perrot, Pacôme Perrotin, Sylvain Sené. 68-80 [doi]
- On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite AutomataSemyon Petrov, Alexander Okhotin. 81-93 [doi]
- Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-completeAaron Lye. 97-108 [doi]
- On the Power of Nondeterministic Circuits and Co-Nondeterministic CircuitsHiroki Morizumi. 109-117 [doi]
- On Hardest Languages for One-Dimensional Cellular AutomataMikhail Mrykhin, Alexander Okhotin. 118-130 [doi]
- Usefulness of Information and Unary LanguagesGiovanni Pighizzini, Branislav Rovan, Simon Sádovský. 131-142 [doi]
- Learnability and Positive Equivalence RelationsDavid Belanger, Ziyuan Gao, Sanjay Jain 0001, Wei Li 0050, Frank Stephan 0001. 145-156 [doi]
- Learning Mealy Machines with One TimerFrits W. Vaandrager, Roderick Bloem, Masoud Ebrahimi 0002. 157-170 [doi]
- Finite-Word HyperlanguagesBorzoo Bonakdarpour, Sarai Sheinvald. 173-186 [doi]
- Temporal Logics with Language ParametersJens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz. 187-199 [doi]
- Commutative Rational Term RewritingMamoru Ishizuka, Takahito Aoto 0001, Munehiro Iwami. 200-212 [doi]
- Context-Free Grammars with LookaheadTakayuki Miyazaki, Yasuhiko Minamide. 213-225 [doi]
- Tree-Like Unit Refutations in Horn Constraint SystemsK. Subramani, Piotr J. Wojciechowski. 226-237 [doi]
- Homomorphic Characterization of Tree Languages Based on Comma-Free EncodingStefano Crespi-Reghizzi, Pierluigi San Pietro. 241-254 [doi]
- Approximated Determinisation of Weighted Tree AutomataFrederic Dörband, Thomas Feller, Kevin Stier. 255-266 [doi]
- Sequentiality of Group-Weighted Tree AutomataFrederic Dörband, Thomas Feller, Kevin Stier. 267-278 [doi]
- An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted GraphsBastien Sérée, Loïg Jezequel, Didier Lime. 279-290 [doi]
- On Balanced Sequences and Their Asymptotic Critical ExponentFrancesco Dolce, L'ubomíra Dvoráková, Edita Pelantová. 293-304 [doi]
- Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing WordsStefan Hoffmann. 305-317 [doi]
- State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary AlphabetsStefan Hoffmann. 318-330 [doi]
- Cadences in Grammar-Compressed StringsJulian Pape-Lange. 331-342 [doi]