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
Authors: Ulrich Ultes-Nitsche 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.014
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximately satisfied properties of systems and simple language homomorphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Almost Deterministic ω-Automata with Existential Output Condition
- 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)
