A power-set construction for reducing Büchi automata to non-determinism degree two
From MaRDI portal
Publication:845908
DOI10.1016/J.IPL.2006.08.014zbMATH Open1185.68402OpenAlexW2002662108MaRDI QIDQ845908FDOQ845908
Recommendations
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
- On the Accepting Power of 2-Tape Büchi Automata
- scientific article; zbMATH DE number 2201370
- Determinization of Büchi-Automata
- Tighter Bounds for the Determinisation of Büchi Automata
- On complementing nondeterministic Büchi automata
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
- Implementation and Application of Automata
- Observations on determinization of Büchi automata
Cites work
- scientific article; zbMATH DE number 3982543 (Why is no real title available?)
- scientific article; zbMATH DE number 48095 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3341983 (Why is no real title available?)
- Almost Deterministic ω-Automata with Existential Output Condition
- Approximately satisfied properties of systems and simple language homomorphisms
- Relative liveness and behavior abstraction (extended abstract)
Cited in
(3)
This page was built for publication: A power-set construction for reducing Büchi automata to non-determinism degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845908)
