Abstract is missing.
- Measuring Information in Timed LanguagesEugene Asarin. 1-2 [doi]
- Automata-Based Symbolic Representations of PolyhedraBernard Boigelot, Julien Brusten, Jean-François Degbomont. 3-20 [doi]
- Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum TheoryGilles Dowek. 21-37 [doi]
- A Parameterized Complexity TutorialRod Downey. 38-56 [doi]
- The Computer Science of DNA NanotechnologyJack H. Lutz. 57 [doi]
- The Minimal Cost Reachability Problem in Priced Timed Pushdown SystemsParosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman. 58-69 [doi]
- Unification Modulo ChainingSiva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch. 70-82 [doi]
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth CircuitsVikraman Arvind, Yadu Vasudev. 83-94 [doi]
- Reversible Multi-head Finite Automata Characterize Reversible Logarithmic SpaceHolger Bock Axelsen. 95-105 [doi]
- Defining Contexts in Context-Free GrammarsMikhail Barash, Alexander Okhotin. 106-118 [doi]
- Longest Common Extensions via FingerprintingPhilip Bille, Inge Li Gørtz, Jesper Kristensen. 119-130 [doi]
- Fast and Cache-Oblivious Dynamic Programming with Local DependenciesPhilip Bille, Morten Stöckel. 131-142 [doi]
- An Efficient Implicit OBDD-Based Algorithm for Maximal MatchingsBeate Bollig, Tobias Pröger. 143-154 [doi]
- Strong Termination for Gap-Order Constraint Abstractions of Counter SystemsLaura Bozzelli. 155-168 [doi]
- Covering Space in the Besicovitch TopologyJulien Cervelle. 169-178 [doi]
- Approximate Regular Expressions and Their DerivativesJean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot. 179-191 [doi]
- Catalytic Petri Nets Are Turing CompleteGabriel Ciobanu, G. Michele Pinna. 192-203 [doi]
- Computational Complexity of Rule Distributions of Non-uniform Cellular AutomataAlberto Dennunzio, Enrico Formenti, Julien Provillard. 204-215 [doi]
- Conservative Groupoids Recognize Only Regular LanguagesDanny Dubé, Mario Latendresse, Pascal Tesson. 216-227 [doi]
- Advice Complexity of Online Coloring for PathsMichal Forisek, Lucia Keller, Monika Steinová. 228-239 [doi]
- A Faster Grammar-Based Self-indexTravis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi. 240-251 [doi]
- Learnability of Co-r.e. ClassesZiyuan Gao, Frank Stephan. 252-263 [doi]
- Two-Way Automata Making Choices Only at the EndmarkersViliam Geffert, Bruno Guillon, Giovanni Pighizzini. 264-276 [doi]
- Polynomial-Time Algorithms for Learning Typed Pattern LanguagesMichael Geilke, Sandra Zilles. 277-288 [doi]
- Forbidding Sets and Normal Forms for Language Forbidding-Enforcing SystemsDaniela Genova. 289-300 [doi]
- Applying Tree Languages in Proof TheoryStefan Hetzl. 301-312 [doi]
- The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical ConstraintsDag Hovland. 313-324 [doi]
- Characterizing the Rational Functions by Restarting TransducersNorbert Hundeshagen, Friedrich Otto. 325-336 [doi]
- Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing MachinesOscar H. Ibarra, Nicholas Q. Trân. 337-350 [doi]
- Feasible Automata for Two-Variable Logic with Successor on Data WordsAhmet Kara, Thomas Schwentick, Tony Tan. 351-362 [doi]
- Nash Equilibria in Concurrent Priced GamesMiroslav Klimos, Kim G. Larsen, Filip Stefanak, Jeppe Thaarup. 363-376 [doi]
- Computing by Observing InsertionAlexander Krassovitskiy, Peter Leupold. 377-388 [doi]
- On the Parameterized Complexity of Default Logic and Autoepistemic LogicArne Meier, Johannes Schmidt 0001, Michael Thomas, Heribert Vollmer. 389-400 [doi]
- Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph BiautomaticAlexei Miasnikov, Zoran Sunic. 401-407 [doi]
- On Model Checking for Visibly Pushdown AutomataNguyen Van Tang, Hitoshi Ohsaki. 408-419 [doi]
- Automaton-Based Array Initialization AnalysisDurica Nikolic, Fausto Spoto. 420-432 [doi]
- Dynamics of Circuits and Intersecting CircuitsMathilde Noual. 433-444 [doi]
- Canonizable Partial Order GeneratorsMateus de Oliveira Oliveira. 445-457 [doi]
- Ogden's Lemma for ET0L LanguagesMax Rabkin. 458-467 [doi]
- Patterns with Bounded TreewidthDaniel Reidenbach, Markus L. Schmid. 468-479 [doi]
- P-NP Threshold for Synchronizing Road ColoringAdam Roman. 480-489 [doi]
- k-Automatic Sets of Rational NumbersEric Rowland, Jeffrey Shallit. 490-501 [doi]
- On Stable and Unstable Limit Sets of Finite Families of Cellular AutomataVille Salo, Ilkka Törmä. 502-513 [doi]
- Automaton Ranks of Some Self-similar GroupsAdam Woryna. 514-525 [doi]
- One-Way Reversible and Quantum Finite Automata with AdviceTomoyuki Yamakami. 526-537 [doi]
- Integration of the Dual Approaches in the Distributional Learning of Context-Free GrammarsRyo Yoshinaka. 538-550 [doi]