- On the decidability of the real exponential field: candidates for a complete axiomatization Tamara Servi Thu 02 November 2017
- Quasi-decidability of a Fragment of the First-order Theory of Real Numbers Peter Franek Stefan Ratschan Piotr Zgliczynski Thu 02 November 2017
- Safety verification of non-linear hybrid systems is quasi-decidable Stefan Ratschan Thu 02 November 2017
- Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable Peter Franek Stefan Ratschan Piotr Zgliczynski Thu 02 November 2017
- An Introduction to Timed Automata Patricia Bouyer Thu 02 November 2017
- NFA reduction algorithms by means of regular inequalities J.-M. Champarnaud F. Coulon Thu 02 November 2017
- On NFA Reductions Lucian Ilie Gonzalo Navarro Sheng Yu Thu 02 November 2017
- On the Decidability of the Ordered Structures of Numbers Ziba Assadi Saeed Salehi Tue 31 October 2017
- Uber der Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt Mojżesz Presburger Mon 30 October 2017
- The complexity of logical theories Leonard Berman Mon 30 October 2017
- Topological Complexity of Sets De ned by Automata and Formulas Szczepan Hummel Mon 30 October 2017
- Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection Milan Ceska Vojtech Havlena Lukas Holik Ondrej Lengal Tomas Vojnar Mon 30 October 2017
- Control from computer science Oded Maler Thu 26 October 2017
- Verifying Higher-Order Functions with Tree Automata: Extended Version Thomas Genet Timothée Haudebourg Thomas Jensen Tue 24 October 2017
- On the infinitary proof theory of logics with fixed points Amina Doumane Mon 23 October 2017
- Constructive completeness for the linear-time x03BC;-calculus Amina Doumane Mon 23 October 2017
- Sigref: A Symbolic Bisimulation Tool Box Ralf Wimmer Marc Herbstritt Holger Hermanns Kelley Strampp Bernd Becker Thu 19 October 2017
- Three Partition Refinement Algorithms Robert Paige Robert E. Tarjan Thu 19 October 2017
- Automata on Inifinite Trees Christof Løding Fri 13 October 2017
- Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings Arnaud Carayol Christof Løding Olivier Serre Fri 13 October 2017
Library Size: 13G (12984 entries),
Last Updated: Apr 23, 2026, 21:48:37,
Build Time: N/A
