Abstract is missing.
- Non-Zero Sum Games for Reactive SynthesisRomain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas. 3-23 [doi]
- ALC ALC Using Weighted Tree AutomataFranz Baader, Andreas Ecke. 63-75 [doi]
- +\omega + ω -Picture Languages Recognizable by Büchi-Tiling SystemsParvaneh Babari, Nicole Schweikardt. 76-88 [doi]
- A Logical Characterization for Dense-Time Visibly Pushdown AutomataDevendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi. 89-101 [doi]
- A Complexity Measure on Büchi AutomataDana Fisman. 102-113 [doi]
- Compositional Bisimulation Minimization for Interval Markov Decision ProcessesVahid Hashemi, Holger Hermanns, Lei Song 0001, K. Subramani, Andrea Turrini, Piotr J. Wojciechowski. 114-126 [doi]
- A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot TheoremHeiko Vogler, Manfred Droste, Luisa Herrmann. 127-139 [doi]
- Colored Nested WordsRajeev Alur, Dana Fisman. 143-155 [doi]
- Input-Driven Queue Automata with Internal TransductionsMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 156-167 [doi]
- Periodic Generalized Automata over the RealsKlaus Meer, Ameen Naif. 168-180 [doi]
- Minimal Separating Sequences for All Pairs of StatesRick Smetsers, Joshua Moerman, David N. Jansen. 181-193 [doi]
- Forkable Regular ExpressionsMartin Sulzmann, Peter Thiemann. 194-206 [doi]
- On the Levenshtein Automaton and the Size of the Neighbourhood of a WordHélène Touzet. 207-218 [doi]
- Parallelogram Morphisms and Circular CodesAlexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay. 221-232 [doi]
- On Del-Robust Primitive Partial Words with One HoleAnanda Chandra Nayak, Amit Kumar Srivastava. 233-244 [doi]
- Optimal Bounds for Computing \alpha α -gapped RepeatsMaxime Crochemore, Roman Kolpakov, Gregory Kucherov. 245-255 [doi]
- On XOR Lemma for Polynomial Threshold Weight and LengthKazuyuki Amano. 259-269 [doi]
- The Beachcombers' Problem: Walking and Searching from an Inner Point of a LineYu Chen, Xiaotie Deng, Ziwei Ji, Chao Liao. 270-282 [doi]
- Using Duality in Circuit ComplexitySilke Czarnetzki, Andreas Krebs. 283-294 [doi]
- The Minimum Entropy Submodular Set Cover ProblemGabriel Istrate, Cosmin Bonchis, Liviu P. Dinu. 295-306 [doi]
- On the Capacity of Capacitated AutomataOrna Kupferman, Sarai Sheinvald. 307-319 [doi]
- The Complexity of Induced Tree Reconfiguration ProblemsKunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura. 330-342 [doi]
- The Missing Case in Chomsky-Schützenberger TheoremStefano Crespi-Reghizzi, Pierluigi San Pietro. 345-358 [doi]
- Homomorphic Characterizations of Indexed LanguagesSéverine Fratani, El Makki Voundy. 359-370 [doi]
- Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language HierarchyMakoto Kanazawa. 371-383 [doi]
- Steganography Based on Pattern LanguagesSebastian Berndt, Rüdiger Reischuk. 387-399 [doi]
- Inferring a Relax NG Schema from XML DocumentsGuen-Hae Kim, Sang-Ki Ko, Yo-Sub Han. 400-411 [doi]
- Noise Free Multi-armed Bandit GameAtsuyoshi Nakamura, David P. Helmbold, Manfred K. Warmuth. 412-423 [doi]
- Properties of Regular DAG LanguagesJohannes Blum, Frank Drewes. 427-438 [doi]
- Normal Form on Linear Tree-to-Word TransducersAdrien Boiret. 439-451 [doi]
- A Kleene Theorem for Weighted Tree Automata over Tree Valuation MonoidsManfred Droste, Zoltán Fülöp, Doreen Götze. 452-463 [doi]
- Hankel Matrices for Weighted Visibly Pushdown AutomataNadia Labai, Johann A. Makowsky. 464-477 [doi]
- Linear Context-Free Tree Languages and Inverse HomomorphismsJohannes Osterholzer, Toni Dietze, Luisa Herrmann. 478-489 [doi]
- Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded LanguagesPaul C. Bell, Shang Chen, Lisa Jackson. 493-505 [doi]
- The Word Problem for HNN-extensions of Free Inverse SemigroupsTatiana Baginová Jajcayová. 506-517 [doi]
- Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG GrammarsHenrik Björklund, Frank Drewes, Petter Ericson. 521-532 [doi]
- An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic TimeSanguthevar Rajasekaran, Marius Nicolae. 533-546 [doi]
- Accurate Approximate Diagnosability of Stochastic SystemsNathalie Bertrand 0001, Serge Haddad, Engel Lefaucheux. 549-561 [doi]
- Proof-Based Synthesis of Sorting Algorithms for TreesIsabela Dramnesc, Tudor Jebelean, Sorin Stratulat. 562-575 [doi]
- Reversible Shrinking Two-Pushdown AutomataHolger Bock Axelsen, Markus Holzer 0001, Martin Kutrib, Andreas Malcher. 579-591 [doi]
- Reachability in Resource-Bounded Reaction SystemsAlberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca. 592-602 [doi]
- Canonical Multi-target Toffoli CircuitsHans-Jörg Kreowski, Sabine Kuske, Aaron Lye. 603-616 [doi]