Abstract is missing.
- Partial-Observation Stochastic Reachability and Parity GamesKrishnendu Chatterjee. 1-4 [doi]
- Random Deterministic AutomataCyril Nicaud. 5-23 [doi]
- Communication Complexity Theory: Thirty-Five Years of Set DisjointnessAlexander A. Sherstov. 24-43 [doi]
- What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?Christian Sohler. 44-49 [doi]
- Choiceless Polynomial Time on Structures with Small Abelian Colour ClassesFaried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa. 50-62 [doi]
- Sofic-Dyck ShiftsMarie-Pierre Béal, Michel Blockelet, Catalin Dima. 63-74 [doi]
- A Logical Characterization of Timed (non-)Regular LanguagesMarcello M. Bersani, Matteo Rossi, Pierluigi San Pietro. 75-86 [doi]
- Asymptotic Monadic Second-Order LogicAchim Blumensath, Olivier Carton, Thomas Colcombet. 87-98 [doi]
- Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential RulesPierre Bourhis, Michael Morak, Andreas Pieris. 99-110 [doi]
- Alternating Parity Krivine AutomataFlorian Bruse. 111-122 [doi]
- Advances in Parametric Real-Time ReasoningDaniel Bundala, Joël Ouaknine. 123-134 [doi]
- Universal Lyndon WordsArturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino. 135-146 [doi]
- Subword Complexity and Decomposition of the Set of FactorsJulien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni. 147-158 [doi]
- Cyclic Complexity of WordsJulien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni. 159-170 [doi]
- Classifying Recognizable Infinitary Trace Languages Using Word AutomataNamit Chaturvedi, Marcus Gelderie. 171-182 [doi]
- Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's TheoremYijia Chen, Moritz Müller. 183-195 [doi]
- An Algebraic Characterization of Unary Two-Way TransducersChristian Choffrut, Bruno Guillon. 196-207 [doi]
- Size-Change Abstraction and Max-Plus AutomataThomas Colcombet, Laure Daviaud, Florian Zuleger. 208-219 [doi]
- Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract)Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra. 232-243 [doi]
- Relating Nominal and Higher-Order RewritingJesús Domínguez, Maribel Fernández. 244-255 [doi]
- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded StructuresKord Eickmeyer, Michael Elberfeld, Frederik Harwath. 256-266 [doi]
- Two Recursively Inseparable Problems for Probabilistic AutomataNathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj. 267-278 [doi]
- Monadic Second-Order Logic with Arbitrary Monadic PredicatesNathanaël Fijalkow, Charles Paperman. 279-290 [doi]
- Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic AutomataViliam Geffert, Alexander Okhotin. 291-302 [doi]
- Measure Properties of Game Tree LanguagesTomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak. 303-314 [doi]
- On Upper and Lower Bounds on the Length of Alternating TowersStepan Holub, Galina Jirásková, Tomás Masopust. 315-326 [doi]
- L ax F: Side Conditions and External Evidence as MonadsFurio Honsell, Luigi Liquori, Ivan Scagnetto. 327-339 [doi]
- The Monoid of Queue ActionsMartin Huschenbett, Dietrich Kuske, Georg Zetzsche. 340-351 [doi]
- Undecidable Properties of Self-affine Sets and Multi-tape AutomataTimo Jolivet, Jarkko Kari. 352-364 [doi]
- Complexity and Expressivity of Uniform One-Dimensional Fragment with EqualityEmanuel Kieronski, Antti Kuusisto. 365-376 [doi]
- A Unifying Approach for Multistack Pushdown AutomataSalvatore La Torre, Margherita Napoli, Gennaro Parlato. 377-389 [doi]
- Definability and Transformations for Cost Logics and Automatic StructuresMartin Lang, Christof Löding, Amaldev Manuel. 390-401 [doi]
- Generalised Lyndon-Schützenberger EquationsFlorin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki. 402-413 [doi]
- Complexity of Equivalence and Learning for Multiplicity Tree AutomataInes Marusic, James Worrell. 414-425 [doi]
- Monadic Datalog and Regular Tree Pattern QueriesFilip Mazowiecki, Filip Murlak, Adam Witkowski. 426-437 [doi]
- Model Checking Concurrent Recursive Programs Using Temporal LogicsRoy Mennicke. 438-450 [doi]
- Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the RationalsAngelo Montanari, Gabriele Puppis, Pietro Sala. 451-463 [doi]
- Reachability in Pushdown Register AutomataAndrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos. 464-473 [doi]
- A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite StructuresAbhisekh Sankaran, Bharat Adsul, Supratik Chakraborty. 474-485 [doi]
- Determinising Parity AutomataSven Schewe, Thomas Varghese. 486-498 [doi]
- Tight Bounds for Complementing Parity AutomataSven Schewe, Thomas Varghese. 499-510 [doi]
- On Infinite Words Determined by Indexed LanguagesTim Smith. 511-522 [doi]
- A Pumping Lemma for Two-Way Finite TransducersTim Smith. 523-534 [doi]
- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction ProblemsMichal Wrona. 535-546 [doi]
- The Dynamic Descriptive Complexity of k-CliqueThomas Zeume. 547-558 [doi]