A power-set construction for reducing Büchi automata to non-determinism degree two

DOI10.1016/j.ipl.2006.08.014zbMath1185.68402OpenAlexW2002662108MaRDI QIDQ845908

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

zbMATH Keywords

formal languagesBüchi automatanon-determinismregular \(\omega \)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximately satisfied properties of systems and simple language homomorphisms
• Almost Deterministic ω-Automata with Existential Output Condition
• Relative liveness and behavior abstraction (extended abstract)

This page was built for publication: A power-set construction for reducing Büchi automata to non-determinism degree two