Abstract is missing.
- Complexity in Convex LanguagesJanusz A. Brzozowski. 1-15 [doi]
- Three Learnable Models for the Description of LanguageAlexander Clark. 16-31 [doi]
- Arbology: Trees and Pushdown AutomataBorivoj Melichar. 32-49 [doi]
- Analysis of Communicating AutomataAnca Muscholl. 50-57 [doi]
- Complexity of the Satisfiability Problem for a Class of Propositional SchemataVincent Aravantinos, Ricardo Caferra, Nicolas Peltier. 58-69 [doi]
- A Simple ::::n::::-Dimensional Intrinsically Universal Quantum Cellular AutomatonPablo Arrighi, Jonathan Grattage. 70-81 [doi]
- A Fast Longest Common Subsequence Algorithm for Similar StringsAbdullah N. Arslan. 82-93 [doi]
- Abelian Square-Free Partial WordsFrancine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons. 94-105 [doi]
- Avoidable Binary Patterns in Partial WordsFrancine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein. 106-117 [doi]
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi AutomataNicolas Bousquet, Christof Löding. 118-129 [doi]
- Pregroup Grammars with Letter PromotionsWojciech Buszkowski, Zhe Lin. 130-141 [doi]
- A Hierarchical Classification of First-Order Recurrent Neural NetworksJérémie Cabessa, Alessandro E. P. Villa. 142-153 [doi]
- Choosing Word Occurrences for the Smallest Grammar ProblemRafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López. 154-165 [doi]
- Agreement and Cliticization in Italian: A Pregroup AnalysisClaudia Casadio. 166-177 [doi]
- Geometricity of Binary Regular LanguagesJean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne. 178-189 [doi]
- On the Expressive Power of FO[ + ]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. 190-201 [doi]
- Finding Consistent Categorial Grammars of Bounded Value: A Parameterized ApproachChristophe Costa Florêncio, Henning Fernau. 202-213 [doi]
- Operator Precedence and the Visibly Pushdown PropertyStefano Crespi-Reghizzi, Dino Mandrioli. 214-226 [doi]
- On the Maximal Number of Cubic Runs in a StringMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 227-238 [doi]
- On the Hamiltonian Operators for Adiabatic Quantum Reduction of SATWilliam Cruz-Santos, Guillermo Morales-Luna. 239-248 [doi]
- Parametric Metric Interval Temporal LogicBarbara Di Giampaolo, Salvatore La Torre, Margherita Napoli. 249-260 [doi]
- Short Witnesses and Accepting Lassos in ::::omega::::-AutomataRüdiger Ehlers. 261-272 [doi]
- Grammar-Based Compression in a Streaming ModelTravis Gagie, Pawel Gawrychowski. 273-284 [doi]
- Simplifying Regular ExpressionsHermann Gruber, Stefan Gulan. 285-296 [doi]
- A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on NetworksReinhard Hemmerling, Katarína Smolenová, Winfried Kurth. 297-308 [doi]
- The Inclusion Problem for Regular ExpressionsDag Hovland. 309-320 [doi]
- Learnability of Automatic ClassesSanjay Jain, Qinglong Luo, Frank Stephan. 321-332 [doi]
- Untestable Properties Expressible with Four First-Order QuantifiersCharles Jordan, Thomas Zeugmann. 333-343 [doi]
- The Copying Power of Well-Nested Multiple Context-Free GrammarsMakoto Kanazawa, Sylvain Salvati. 344-355 [doi]
- Post Correspondence Problem with Partially Commutative AlphabetsBarbara Klunder, Wojciech Rytter. 356-367 [doi]
- Reversible Pushdown AutomataMartin Kutrib, Andreas Malcher. 368-379 [doi]
- String Extension Learning Using LatticesAnna Kasprzik, Timo Kötzing. 380-391 [doi]
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional TapeAlexander A. Letichevsky, Arsen S. Shoukourian, Samvel K. Shoukourian. 392-402 [doi]
- Primitive Words Are Unavoidable for Context-Free LanguagesPeter Leupold. 403-413 [doi]
- Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-FreenessZhe Lin. 414-425 [doi]
- Hard Counting Problems for Partial WordsFlorin Manea, Catalin Tiseanu. 426-438 [doi]
- Exact Analysis of Horspool s and Sunday s Pattern Matching Algorithms with Probabilistic Arithmetic AutomataTobias Marschall, Sven Rahmann. 439-450 [doi]
- SA-REPC - Sequence Alignment with Regular Expression Path ConstraintNimrod Milo, Tamar Pinhas, Michal Ziv-Ukelson. 451-462 [doi]
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace LanguagesBenedek Nagy, Friedrich Otto. 463-474 [doi]
- A Boundary between Universality and Non-universality in Extended Spiking Neural P SystemsTurlough Neary. 475-487 [doi]
- Using Sums-of-Products for Non-standard ReasoningRafael Peñaloza. 488-499 [doi]
- Restarting Automata with Structured Output and Functional Generative DescriptionMartin Plátek, Frantisek Mráz, Markéta Lopatková. 500-511 [doi]
- A Randomized Numerical Aligner (rNA)Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi. 512-523 [doi]
- Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered DataFernando Rosa Velardo, Giorgio Delzanno. 524-535 [doi]
- Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)Neda Saeedloei, Gopal Gupta. 536-548 [doi]
- Incremental Building in Peptide Computing to Solve Hamiltonian Path ProblemMuthiah Sakthi Balan, Parameswaran Seshan. 549-560 [doi]
- Variable Automata over Infinite AlphabetsOrna Grumberg, Orna Kupferman, Sarai Sheinvald. 561-572 [doi]
- Some Minimality Results on Biresidual and Biseparable AutomataHellis Tamm. 573-584 [doi]
- Extending Stochastic Context-Free Grammars for an Application in BioinformaticsFrank Weinberg, Markus E. Nebel. 585-595 [doi]
- Chomsky-Schützenberger-Type Characterization of Multiple Context-Free LanguagesRyo Yoshinaka, Yuichi Kaji, Hiroyuki Seki. 596-607 [doi]
- Complexity of Guided Insertion-Deletion in RNA-EditingHans Zantema. 608-619 [doi]