- Abstractions from Proofs Thomas A. Henzinger Ranjit Jhala Rupak Majumdar Kenneth L. McMillan Fri 29 January 2016
- A new algorithm for testing if a regular language is locally threshold testable Mikołaj Bojańczyk Fri 29 January 2016
- A decidable characterization of locally testable tree languages Thomas Place Luc Segoufin Fri 29 January 2016
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages Thomas Place Lorijn van Rooijen Marc Zeitoun Fri 29 January 2016
- Efficient Separability of Regular Languages by Subsequences and Suffixes Wojciech Czerwiński Wim Martens Tomáš Masopust Fri 29 January 2016
- Separating Regular Languages with Two Quantifiers Alternations Thomas Place Fri 29 January 2016
- Recognisable Languages over Monads Mikołaj Bojańczyk Fri 29 January 2016
- Separating Regular Languages by Piecewise Testable and Unambiguous Languages Thomas Place Lorijn Rooijen Marc Zeitoun Fri 29 January 2016
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words Thomas Place Marc Zeitoun Fri 29 January 2016
- Separation and the Successor Relation Thomas Place Marc Zeitoun Fri 29 January 2016
- Separating Regular Languages with First-order Logic Thomas Place Marc Zeitoun Fri 29 January 2016
- Separability of Rational Relations in A^* times mathbb N^m by Recognizable Relations is Decidable Christian Choffrut Serge Grigorieff Mon 25 January 2016
- Complexity of Problems of Commutative Grammars Eryk Kopczynski Mon 25 January 2016
- Invisible pushdown languages Eryk Kopczynski Mon 25 January 2016
- The complexity of equivalence problems for commutative grammars Dung T. Huynh Mon 25 January 2016
- Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images Christoph Haase Stefan Kiefer Markus Lohrey Mon 25 January 2016
- Petri nets and regular languages Rudiger Valk Guy Vidal-Naquet Fri 22 January 2016
- When Does Partial Commutative Closure Preserve Regularity Antonio Cano Gómez Giovanna Guaiana Jean-Éric Pin Fri 22 January 2016
- A Graph-based Regularity Test for Deterministic Context-free Languages Priti Shankar B. S. Adiga Fri 22 January 2016
- Counting in Trees for Free Helmut Seidl Thomas Schwentick Anca Muscholl Peter Habermehl Thu 21 January 2016
Library Size: 13G (12984 entries),
Last Updated: Apr 23, 2026, 21:48:37,
Build Time: N/A
