- On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages D. Bruschi G. Pighizzini N. Sabadini Fri 29 June 2018
- APEX: An Analyzer for Open Probabilistic Programs Stefan Kiefer Andrzej S. Murawski Joel Ouaknine Bjørn Wachter James Worrell Fri 29 June 2018
- Hereditarily Sequential Functionals Hanno Nickau Fri 29 June 2018
- SIGLOG news N/A Fri 29 June 2018
- Polynomial automata: Zeroness and applications M. Benedikt T. Duff A. Sharad J. Worrell Fri 29 June 2018
- Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable Helmut Seidl Sebastian Maneth Gregor Kemper Fri 29 June 2018
- Some Algebraic and Geometric Computations in PSPACE John Canny Mon 25 June 2018
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases Alberto Bertoni Christian Choffrut Roberto Radicioni Fri 22 June 2018
- On finite monoids having only trivial subgroups Marcel-Paul Schützenberger Fri 22 June 2018
- The tractability frontier for NFA minimization Henrik Bjørklund Wim Martens Fri 22 June 2018
- Errata to: ``Finite Automata and Unary Languages'' Marek Chrobak Fri 22 June 2018
- The parallel complexity of finite-state automata problems Sang Cho Dung T. Huynh Fri 22 June 2018
- Operations on Unambiguous Finite Automata Jozef Jirásek Galina Jirásková Juraj Šebej Thu 21 June 2018
- Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata Yuya Uezato Yasuhiko Minamide Thu 21 June 2018
- State complexity of complementing unambiguous automata Maciej Dębski Thu 21 June 2018
- ICE-Based Refinement Type Discovery for Higher-Order Functional Programs Adrien Champion Tomoya Chiba Naoki Kobayashi Ryosuke Sato Thu 21 June 2018
- The Complexity of Concurrent Rational Synthesis R. Condurache Y. Oualhadj N. Troquard Thu 21 June 2018
- Alternating Nonzero Automata P. Fournier H. Gimbert Thu 21 June 2018
- Linear Equations with Ordered Data P. Hofman S. Lasota Thu 21 June 2018
- It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ``Happened Before'' B. Bollig M. Fortin P. Gastin Thu 21 June 2018
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
