Abstract is missing.
- Constraint Satisfaction Problems: Complexity and AlgorithmsAndrei A. Bulatov. 1-25 [doi]
- Sliding Window Algorithms for Regular LanguagesMoses Ganardi, Danny Hucke, Markus Lohrey. 26-35 [doi]
- Underlying Principles and Recurring Ideas of Formal GrammarsAlexander Okhotin. 36-59 [doi]
- Reshaping the Context-Free Model: Linguistic and Algorithmic AspectsEli Shamir 0001. 60-67 [doi]
- Formal Languages over GF(2)Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva. 68-79 [doi]
- Event-Clock Nested AutomataLaura Bozzelli, Aniello Murano, Adriano Peron. 80-92 [doi]
- On the Synchronization of Planar AutomataJ. Andres Montoya, Christian Nolasco. 93-104 [doi]
- Descriptional and Computational Complexity of the Circuit Representation of Finite AutomataMaris Valdats. 105-117 [doi]
- Disturbance Decoupling in Finite AutomataAlexey N. Zhirabok, Alexey Ye. Shumsky. 118-129 [doi]
- Default Logic and Bounded TreewidthJohannes Klaus Fichte, Markus Hecher, Irina Schindler. 130-142 [doi]
- A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential TransducersStefan Gerdjikov. 143-155 [doi]
- Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial HierarchyDemen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf. 156-168 [doi]
- Learners Based on TransducersSanjay Jain, Shao Ning Kuek, Eric Martin 0002, Frank Stephan 0001. 169-181 [doi]
- Model Learning as a Satisfiability Modulo Theories ProblemRick Smetsers, Paul Fiterau-Brostean, Frits W. Vaandrager. 182-194 [doi]
- Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative AspectsAndrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger. 195-206 [doi]
- Bubble-Flip - A New Generation Algorithm for Prefix Normal WordsFerdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi. 207-219 [doi]
- Permutations Sorted by a Finite and an Infinite Stack in SeriesMurray Elder, Yoong Kuan Goh. 220-231 [doi]
- On Periodicity Lemma for Partial WordsTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 232-244 [doi]
- Measuring Closeness Between Cayley Automatic Groups and Automatic GroupsDmitry Berdinsky, Phongpitak Trakuldit. 245-257 [doi]
- Pomsets and Unfolding of Reset Petri NetsThomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux. 258-270 [doi]
- Timed Comparisons of Semi-Markov ProcessesMathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim G. Larsen, Radu Mardare. 271-283 [doi]
- Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi SemiringMarkus Saers, Dekai Wu. 284-295 [doi]
- Over-Approximative Petri Net Synthesis for Restricted Subclasses of NetsUli Schlachter. 296-307 [doi]
- Efficient Translation with Linear BimorphismsChristoph Teichmann, Antoine Venant, Alexander Koller. 308-320 [doi]