- Separability by Short Subsequences and Subwords Piotr Hofman Wim Martens Sat 16 January 2016
- LR-regular grammars---an extension of LR(k) grammars Karel Čulik Rina Cohen Fri 15 January 2016
- Monadic Second-order Logics with Cardinalities Felix Klaedtke Harald Rueß Thu 14 January 2016
- The size of Higman--Haines sets Hermann Gruber Markus Holzer Martin Kutrib Wed 13 January 2016
- Effective Constructions in Well-partially- Ordered Free Monoids Jan van Leeuwen Wed 13 January 2016
- On the equivalence and containment problems for context-free languages J. E. Hopcroft Wed 13 January 2016
- On the equivalence, containment, and covering problems for the regular and context-free languages Harry B. Hunt Daniel J. Rosenkrantz Thomas G. Szymanski Wed 13 January 2016
- Locally testable languages Yechezkel Zalcstein Wed 13 January 2016
- Noncanonical Extensions of Bottom-Up Parsing Techniques Thomas G. Szymanski John H. Williams Wed 13 January 2016
- Complexity metatheorems for context-free grammar problems Harry B. Hunt III Thomas G. Szymanski Wed 13 January 2016
- On the Decidability of Grammar Problems III H. B. Hunt Wed 13 January 2016
- A Characterization for Decidable Separability by Piecewise Testable Languages Wojciech Czerwiński Wim Martens Lorijn van Rooijen Marc Zeitoun Georg Zetzsche Tue 12 January 2016
- On the expressiveness of Parikh automata and related models Michael Cadilhac Alain Finkel Pierre McKenzie Tue 12 January 2016
- Unambiguous Constrained Automata Michael Cadilhac Alain Finkel Pierre McKenzie Tue 12 January 2016
- A note on undecidable properties of formal languages Sheila Greibach Tue 12 January 2016
- Factorization forests of finite height Imre Simon Tue 12 January 2016
- Language-Theoretic Abstraction Refinement Zhenyue Long Georgel Calin Rupak Majumdar Roland Meyer Tue 12 January 2016
- On the State Complexity of Closures and Interiors of Regular Languages with Subwords and Superwords P. Karandikar M. Niewerth Ph. Schnoebelen Tue 12 January 2016
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity Georg Bachmeier Michael Luttenberger Maximilian Schlund Tue 12 January 2016
- Effective Lossy Queue Languages Parosh Aziz Abdulla Luc Boasson Ahmed Bouajjani Tue 12 January 2016
Library Size: 13G (12986 entries),
Last Updated: Apr 24, 2026, 19:05:09,
Build Time: N/A
