Structural complexity of ω-automata

DOI10.1007/3-540-59042-0_69zbMath1379.68226OpenAlexW177787971MaRDI QIDQ4596617

Anuj Puri, Sriram C. Krishnan, Robert K. Brayton

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_69

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (8)

The Wadge-Wagner hierarchy of ω-rational sets ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time ⋮ Unnamed Item ⋮ Complexity of Topological Properties of Regular ω-Languages ⋮ Approximate Automata for Omega-Regular Languages ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Computing the Rabin Index of a Parity Automaton

This page was built for publication: Structural complexity of ω-automata