Deciding the topological complexity of Büchi languages *

DOI10.4230/LIPIcs.ICALP.2016.99zbMath1388.68181OpenAlexW2560424194MaRDI QIDQ4598240

Michał Skrzypczak, Igor Walukiewicz

Publication date: 19 December 2017

Full work available at URL: https://hal.archives-ouvertes.fr/hal-01394829

zbMATH Keywords

decidabilityBorel setstopological complexitytree automatanon-determinism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (7)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) ⋮ On the Strength of Unambiguous Tree Automata ⋮ On the Way to Alternating Weak Automata ⋮ A Characterisation of Pi^0_2 Regular Tree Languages

This page was built for publication: Deciding the topological complexity of Büchi languages *