- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathbackslash'eødory's Theorem S. Barman Tue 19 June 2018
- Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives T. Brihaye V. Bruyère A. Goeminne J.-F. Raskin Tue 19 June 2018
- An Optimal Value Iteration Algorithm for Parity Games N. Fijalkow Tue 19 June 2018
- Profinite Techniques for Probabilistic Automata Nathanael Fijalkow Tue 19 June 2018
- Universality Analysis for One-Clock Timed Automata Parosh Aziz Abdulla Johann Deneux Joel Ouaknine Karin Quaas James Worrell Tue 19 June 2018
- Verification for Timed Automata extended with Unbounded Discrete Data Structures Karin Quaas Tue 19 June 2018
- Synchronizing Data Words for Register Automata K. Quaas M. Shirmohammadi Tue 19 June 2018
- Deciding First-Order Properties of Nowhere Dense Graphs Martin Grohe Stephan Kreutzer Sebastian Siebertz Mon 18 June 2018
- Model Checking Markov Chains Against Unambiguous Buchi Automata M. Benedikt R. Lenhardt J. Worrell Fri 15 June 2018
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton M. Raskin Fri 15 June 2018
- Unambiguity in Automata Theory Thomas Colcombet Fri 15 June 2018
- Deterministic Priority Mean-payoff Games As Limits of Discounted Games Hugo Gimbert Wiesław Zielonka Fri 15 June 2018
- A Polynomial-time Algorithm for the Equivalence of Probabilistic Automata Wen-Guey Tzeng Tue 12 June 2018
- Language Equivalence for Probabilistic Automata Stefan Kiefer Andrzej S. Murawski Joel Ouaknine Bjørn Wachter James Worrell Tue 12 June 2018
- Language equivalence of probabilistic pushdown automata Vojtěch Forejt Petr Jančar Stefan Kiefer James Worrell Tue 12 June 2018
- Bounded length UCFG equivalence B. Litow Tue 12 June 2018
- Unambiguous Finite Automata Christof Løding Fri 08 June 2018
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages Thomas N. Hibbard Joseph Ullian Fri 08 June 2018
- Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata Markus Holzer Martin Kutrib Fri 08 June 2018
- Descriptional Complexity of Unambiguous Input-driven Pushdown Automata Alexander Okhotin Kai Salomaa Fri 08 June 2018
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
