Abstract is missing.
- The New Complexity Landscape Around Circuit MinimizationEric Allender. 3-16 [doi]
- Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus CasesLaure Daviaud. 17-32 [doi]
- Approaching Arithmetic Theories with Finite-State AutomataChristoph Haase. 33-43 [doi]
- Recompression: Technique for Word Equations and Compressed DataArtur Jez. 44-67 [doi]
- How to Prove that a Language Is Regular or Star-Free?Jean-Éric Pin. 68-88 [doi]
- Deciding Classes of Regular Languages: The Covering ApproachThomas Place. 89-112 [doi]
- Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the CircleDmitry Berdinsky, Prohrak Kruengthomya. 115-127 [doi]
- $\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $Alexis Bès, Christian Choffrut. 128-140 [doi]
- Ordered Semiautomatic Rings with Applications to GeometryZiyuan Gao, Sanjay Jain 0001, Ji Qi, Philipp Schlicht, Frank Stephan 0001, Jacob Tarr. 141-153 [doi]
- Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential FunctionsSiddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden. 157-169 [doi]
- Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic ModelsSusanna Donatelli, Serge Haddad. 170-183 [doi]
- Windable Heads and Recognizing NL with Constant RandomnessMehmet Utkan Gezer. 184-195 [doi]
- Alternating Finite Automata with Limited Universal BranchingChris Keeler, Kai Salomaa. 196-207 [doi]
- 2 with Two OrdersNadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith. 208-221 [doi]
- Limited Two-Way Deterministic Finite Automata with AdviceAhmet Bilal Uçan. 222-232 [doi]
- On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 FunctionKazuyuki Amano. 235-247 [doi]
- Complexity Issues of String to Graph Approximate MatchingRiccardo Dondi, Giancarlo Mauri, Italo Zoppis. 248-259 [doi]
- Complexity of Automatic SequencesHans Zantema. 260-271 [doi]
- Context-Sensitive Fusion Grammars Are UniversalAaron Lye. 275-286 [doi]
- Cyclic Shift on Multi-component GrammarsAlexander Okhotin, Alexey Sorokin. 287-299 [doi]
- The Automatic Baire Property and an Effective Property of ømega-Rational FunctionsOlivier Finkel. 303-314 [doi]
- The Power of Programs over Monoids in [inline-graphic not available: see fulltext]Nathan Grosshans. 315-327 [doi]
- Geometrically Closed Positive Varieties of Star-Free LanguagesOndrej Klíma 0002, Peter Kostolányi. 328-340 [doi]
- Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping LemmasTomoyuki Yamakami. 341-353 [doi]
- On the Weisfeiler-Leman Dimension of Fractional PackingVikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky. 357-368 [doi]
- Input Strictly Local Tree TransducersJing Ji, Jeffrey Heinz. 369-381 [doi]
- Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered WordsPaola Bonizzoni, Clelia de Felice, Rocco Zaccagnino, Rosalba Zizza. 385-396 [doi]
- Reducing the Ambiguity of Parikh MatricesJeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach. 397-411 [doi]
- On Collapsing Prefix Normal WordsPamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen. 412-424 [doi]
- Simplified Parsing Expression DerivativesAaron Moss. 425-436 [doi]
- Complete Variable-Length Codes: An Excursion into Word Edit OperationsJean Néraud. 437-448 [doi]