Complementing Büchi Automata with Ranker
From MaRDI portal
Publication:6487336
DOI10.1007/978-3-031-13188-2_10zbMATH Open1514.681MaRDI QIDQ6487336FDOQ6487336
Authors: Vojtěch Havlena, Ondřej Lengál 
Publication date: 7 December 2022
Recommendations
Cites Work
- Five Determinisation Algorithms
- Experimental Evaluation of Classical Automata Constructions
- Alternating finite automata on \(\omega\)-words
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- The complementation problem for Büchi automata with applications to temporal logic
- Weak alternating automata are not that weak
- Büchi complementation made tight
- Title not available (Why is that?)
- Büchi Complementation and Size-Change Termination
- Advanced automata minimization
- Title not available (Why is that?)
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Seminator 2 can complement generalized Büchi automata via improved semi-determinization
- A Simple and Optimal Complementation Algorithm for Büchi Automata
- Complementing semi-deterministic Büchi automata
- Improved Ramsey-based Büchi complementation
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- An improved construction of deterministic omega-automaton using derivatives
- New optimizations and heuristics for determinization of Büchi automata
- Title not available (Why is that?)
- State of Büchi complementation
- Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
- Complementing Büchi Automata with Ranker
Cited In (5)
This page was built for publication: Complementing Büchi Automata with Ranker
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487336)
