Profile trees for Büchi word automata, with application to determinization
From MaRDI portal
Publication:897653
DOI10.1016/j.ic.2014.12.021zbMath1336.68155arXiv1307.4471OpenAlexW1495139601MaRDI QIDQ897653
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
Publication date: 7 December 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4471
Related Items
On the power of finite ambiguity in Büchi complementation, Towards a grand unification of Büchi complementation constructions, New Optimizations and Heuristics for Determinization of Büchi Automata, From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Observations on determinization of Büchi automata
- Alternating-time temporal logic
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Weak alternating automata are not that weak
- Efficient Büchi Universality Checking
- Tighter Bounds for the Determinisation of Büchi Automata
- The complexity of probabilistic verification
- Unifying B\"uchi Complementation Constructions
- Büchi Complementation Made Tight
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton
- Improved Algorithms for the Automata-Based Approach to Model-Checking
