- Geometric Decision Procedures and the VC Dimension of Linear Arithmetic Theories Dmitry Chistikov Christoph Haase Alessio Mansutti Mon 29 August 2022
- Effective definability of the reachability relation in timed automata Martin Franzle Karin Quaas Mahsa Shirmohammadi James Worrell Mon 09 December 2019
- Operational State Complexity under Parikh Equivalence Giovanna J. Lavado Giovanni Pighizzini Shinnosuke Seki Mon 23 November 2015
- Semigroups, Presburger formulas, and languages Seymour Ginsburg Edwin H. Spanier Tue 27 October 2015
- Stably Computable Predicates Are Semilinear Dana Angluin James Aspnes David Eisenstat Tue 27 October 2015
- A New Proof of a Theorem by Ginsburg and Spanier Markus Kracht Mon 04 November 2013
- Parikh's Theorem: A simple and direct automaton construction Javier Esparza Pierre Ganty Stefan Kiefer Michael Luttenberger Wed 25 September 2013
- On the reachability problem for 5-dimensional vector addition systems John Hopcroft Jean-Jacques Pansiot Wed 31 October 2012
- Projections of vector addition system reachability sets are semilinear Hans Kleine Buening Theodor Lettmann Ernst W. Mayr Tue 30 October 2012
Library Size: 13G (9 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
