The Wadge Hierarchy of Deterministic Tree Languages
From MaRDI portal
Publication:5901536
DOI10.2168/LMCS-4(4:15)2008zbMath1159.03025MaRDI QIDQ5901536
Publication date: 29 April 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)
Related Items (9)
Index Problems for Game Automata ⋮ Regular languages of thin trees ⋮ Unnamed Item ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the Strength of Unambiguous Tree Automata ⋮ Unambiguous Büchi Is Weak ⋮ Wadge-Wagner hierarchies ⋮ A Characterisation of Pi^0_2 Regular Tree Languages ⋮ An upper bound on the complexity of recognizable tree languages
This page was built for publication: The Wadge Hierarchy of Deterministic Tree Languages
