Zielonka DAG acceptance and regular languages over infinite words

DOI10.1007/978-3-031-33264-7_12OpenAlexW4377081510MaRDI QIDQ6067335

Christopher Hugenroth

Publication date: 16 November 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_12

zbMATH Keywords

\( \omega \)-automataextension acceptanceZielonka trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Reasoning about infinite computations
• Modalities for model checking: Branching time logic strikes back
• Inherent size blowup in \(\omega\)-automata
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• On ω-regular sets
• Why These Automata Types?
• Automated Technology for Verification and Analysis
• Mathematical Foundations of Computer Science 2005