Abstract is missing.
- Minimal and Monotone Minimal Perfect Hash FunctionsPaolo Boldi. 3-17 [doi]
- Equational Properties of Fixed Point Operations in Cartesian Categories: An OverviewZoltán Ésik. 18-37 [doi]
- Reversible and Irreversible Computations of Deterministic Finite-State DevicesMartin Kutrib. 38-52 [doi]
- Robust Inference and Local AlgorithmsYishay Mansour. 53-60 [doi]
- Uniform Generation in Trace MonoidsSamy Abbes, Jean Mairesse. 63-75 [doi]
- When Are Prime Formulae Characteristic?Luca Aceto, Dario Della Monica, Ignacio Fábregas, Anna Ingólfsdóttir. 76-88 [doi]
- Stochastization of Weighted AutomataGuy Avni, Orna Kupferman. 89-102 [doi]
- Algebraic Synchronization Criterion and Computing Reset WordsMikhail V. Berlinkov, Marek Szykula. 103-115 [doi]
- Recurrence Function on Sturmian Words: A Probabilistic StudyValérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, Alfredo Viola. 116-128 [doi]
- Exponential-Size Model Property for PDL with Separating Parallel CompositionJoseph Boudou. 129-140 [doi]
- A Circuit Complexity Approach to TransductionsMichaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman. 141-153 [doi]
- Locally Chain-Parsable LanguagesStefano Crespi-Reghizzi, Violetta Lonati, Dino Mandrioli, Matteo Pradella. 154-166 [doi]
- Classes of Languages Generated by the Kleene Star of a WordLaure Daviaud, Charles Paperman. 167-178 [doi]
- Relating Paths in Transition Systems: The Fall of the Modal Mu-CalculusCatalin Dima, Bastien Maubert, Sophie Pinchinat. 179-191 [doi]
- Weighted Automata and Logics on GraphsManfred Droste, Stefan Dück. 192-204 [doi]
- Longest Gapped Repeats and PalindromesMarius Dumitran, Florin Manea. 205-217 [doi]
- Quasiperiodicity and Non-computability in TilingsBruno Durand, Andrei E. Romashchenko. 218-230 [doi]
- The Transitivity Problem of Turing MachinesAnahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés. 231-242 [doi]
- Strong Inapproximability of the Shortest Reset WordPawel Gawrychowski, Damian Straszak. 243-255 [doi]
- Finitary Semantics of Linear Logic and Higher-Order Model-CheckingCharles Grellois, Paul-André Melliès. 256-268 [doi]
- Complexity of Propositional Independence and Inclusion LogicMiika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer. 269-280 [doi]
- Modal Inclusion Logic: Being Lax is Simpler than Being StrictLauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer. 281-292 [doi]
- Differential Bisimulation for a Markovian Process AlgebraGiulio Iacobelli, Mirco Tribastone, Andrea Vandin. 293-306 [doi]
- On the Hardness of Almost-Sure TerminationBenjamin Lucien Kaminski, Joost-Pieter Katoen. 307-318 [doi]
- Graphs Identified by Logics with CountingSandra Kiefer, Pascal Schweitzer, Erkal Selman. 319-330 [doi]
- Synchronizing Automata with Extremal PropertiesAndrzej Kisielewicz, Marek Szykula. 331-343 [doi]
- Ratio and Weight QuantilesDaniel Krähmann, Jana Schubert, Christel Baier, Clemens Dubslaff. 344-356 [doi]
- Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction ProblemVictor Lagerkvist. 357-368 [doi]
- Definability by Weakly Deterministic Regular Expressions with Counters is DecidableMarkus Latte, Matthias Niewerth. 369-381 [doi]
- On the Complexity of Reconfiguration in Systems with Legacy ComponentsJacopo Mauro, Gianluigi Zavattaro. 382-393 [doi]
- Eliminating Recursion from Monadic Datalog Programs on TreesFilip Mazowiecki, Joanna Ochremiak, Adam Witkowski. 394-406 [doi]
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)Arno Pauly. 407-418 [doi]
- Emergence on Decreasing Sandpile ModelsKevin Perrot, Eric Rémila. 419-431 [doi]
- Lost in Self-StabilizationDamien Regnault, Eric Rémila. 432-443 [doi]
- Equations and Coequations for Weighted AutomataJulian Salamanca, Marcello M. Bonsangue, Jan J. M. M. Rutten. 444-456 [doi]