Abstract is missing.
- Factorization ForestsMikolaj Bojanczyk. 1-17 [doi]
- Weighted versus Probabilistic LogicsBenedikt Bollig, Paul Gastin. 18-38 [doi]
- Post Correspondence Problem and Small Dimensional MatricesTero Harju. 39-46 [doi]
- Size Complexity of Two-Way Finite AutomataChristos A. Kapoutsis. 47-66 [doi]
- Matrix Mortality and the Cerný-Pin ConjectureJorge Almeida, Benjamin Steinberg. 67-80 [doi]
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster AutomataMarie-Pierre Béal, Dominique Perrin. 81-90 [doi]
- Regular Languages Definable by Majority Quantifiers with Two VariablesChristoph Behle, Andreas Krebs, Stephanie Reifferscheid. 91-102 [doi]
- The Inclusion Problem of Context-Free Languages: Some Tractable CasesAlberto Bertoni, Christian Choffrut, Roberto Radicioni. 103-112 [doi]
- On the Complexity of Deciding Avoidability of Sets of Partial WordsBrandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad. 113-124 [doi]
- Closures in Formal Languages and Kuratowski s TheoremJanusz A. Brzozowski, Elyot Grant, Jeffrey Shallit. 125-144 [doi]
- Rich and Periodic-Like WordsMichelangelo Bucci, Aldo de Luca, Alessandro De Luca. 145-155 [doi]
- Traces of Control-Flow GraphsSimone Campanoni, Stefano Crespi-Reghizzi. 156-169 [doi]
- Left and Right Synchronous RelationsOlivier Carton. 170-182 [doi]
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic WordsElena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki. 183-194 [doi]
- Asymptotic Cellular ComplexityBruno Durand, Victor Poupet. 195-206 [doi]
- Strongly Regular Grammars and Regular Approximation of Context-Free LanguagesÖmer Egecioglu. 207-220 [doi]
- Powers of Regular LanguagesSzilárd Zsolt Fazekas. 221-227 [doi]
- Existence and Nonexistence of Descriptive PatternsDominik D. Freydenberger, Daniel Reidenbach. 228-239 [doi]
- On Stateless Multihead Finite Automata and Multihead Pushdown AutomataPierluigi Frisco, Oscar H. Ibarra. 240-251 [doi]
- On Negative BasesChristiane Frougny, Anna Chiara Lai. 252-263 [doi]
- Crucial Words for Abelian PowersAmy Glen, Bjarni V. Halldórsson, Sergey Kitaev. 264-275 [doi]
- Tight Bounds on the Descriptional Complexity of Regular ExpressionsHermann Gruber, Markus Holzer. 276-287 [doi]
- Subshifts, Languages and LogicEmmanuel Jeandel, Guillaume Theyssier. 288-299 [doi]
- Magic Numbers and Ternary AlphabetGalina Jirásková. 300-311 [doi]
- The Pumping Lemma for Well-Nested Multiple Context-Free LanguagesMakoto Kanazawa. 312-325 [doi]
- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is RecognizableDaniel Kirsten. 326-333 [doi]
- A Game-Theoretic Characterization of Boolean GrammarsVassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis. 334-347 [doi]
- Word Equations with One UnknownMarkku Laine, Wojciech Plandowski. 348-359 [doi]
- On Equations over Sets of Numbers and Their LimitationsTommi Lehtinen, Alexander Okhotin. 360-371 [doi]
- Some Remarks on Superposition Based on Watson-Crick-Like ComplementarityFlorin Manea, Victor Mitrana, José M. Sempere. 372-383 [doi]
- A Weighted µ-Calculus on WordsIngmar Meinecke. 384-395 [doi]
- Branching-Time Temporal Logics with Minimal Model QuantifiersFabio Mogavero, Aniello Murano. 396-409 [doi]
- Simulations by Time-Bounded Counter MachinesHolger Petersen. 410-418 [doi]
- Weighted Timed MSO LogicsKarin Quaas. 419-430 [doi]
- Balanced Words Having Simple Burrows-Wheeler TransformAntonio Restivo, Giovanna Rosone. 431-442 [doi]
- On the Complexity of Hmelevskii s Theorem and Satisfiability of Three Unknown EquationsAleksi Saarela. 443-453 [doi]
- Definability in the Infix Order on WordsOleg V. Kudinov, Victor L. Selivanov. 454-465 [doi]
- Two-Sided Bounds for the Growth Rates of Power-Free LanguagesArseny M. Shur. 466-477 [doi]
- On the Decidability of the Equivalence for a Certain Class of TransducersRodrigo de Souza. 478-489 [doi]
- Erasing in Petri Net Languages and Matrix GrammarsGeorg Zetzsche. 490-501 [doi]