Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
From MaRDI portal
Publication:6535611
DOI10.1007/978-3-030-99527-0_7zbMATH Open1547.6834MaRDI QIDQ6535611
Unnamed Author, Ondřej Lengál, Vojtěch Havlena
Publication date: 1 February 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complementation problem for Büchi automata with applications to temporal logic
- Complementing deterministic Büchi automata in polynomial time
- Seminator 2 can complement generalized Büchi automata via improved semi-determinization
- Complementing semi-deterministic Büchi automata
- Improved Ramsey-Based Büchi Complementation
- Advanced automata minimization
- State of Büchi Complementation
- An Improved Construction of Deterministic Omega-automaton Using Derivatives
- Learning to Complement Büchi Automata
- New Optimizations and Heuristics for Determinization of Büchi Automata
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Weak alternating automata are not that weak
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Büchi Complementation and Size-Change Termination
- On Minimal Odd Rankings for Büchi Complementation
- A Simple and Optimal Complementation Algorithm for Büchi Automata
- Experimental Evaluation of Classical Automata Constructions
- Büchi Complementation Made Tight
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Correct Hardware Design and Verification Methods
- Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
- Simulations in rank-based Büchi automata complementation
Related Items (1)
This page was built for publication: Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
