On Recognizable Tree Languages Beyond the Borel Hierarchy
From MaRDI portal
Publication:3400555
DOI10.3233/FI-2009-151zbMath1190.03041MaRDI QIDQ3400555
Pierre Simonnet, Olivier Finkel
Publication date: 5 February 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
topological complexityBorel hierarchyregular tree languagecomplete setsinfinite treestree automatonCantor topologydifference hierarchy of analytic setsgame tree languageunambiguous tree automaton
Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)
Related Items (6)
Regular languages of thin trees ⋮ On the Strength of Unambiguous Tree Automata ⋮ Unambiguous Büchi Is Weak ⋮ A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2] ⋮ An upper bound on the complexity of recognizable tree languages ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words
This page was built for publication: On Recognizable Tree Languages Beyond the Borel Hierarchy
