Complexity of Topological Properties of Regular ω-Languages
- Cite this paper as:
- Selivanov V.L., Wagner K.W. (2008) Complexity of Topological Properties of Regular ω-Languages. In: Ito M., Toyama M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg
We determine the complexity of topological properties of regular ω-languages (i.e., classes of ω-languages closed under inverse continuous functions). We show that they are typically NL-complete (PSPACE-complete) for the deterministic Muller, Mostowski and Büchi automata (respectively, for the nondeterministic Rabin, Muller, Mostowski and Büchi automata). For the deterministic Rabin and Streett automata and for the nondeterministic Streett automata upper and lower complexity bounds for the topological properties are established.
Unable to display preview. Download preview PDF.