On the Topological Complexity of Weakly Recognizable Tree Languages

DOI10.1007/978-3-540-74240-1_23zbMath1135.68028OpenAlexW1521217870MaRDI QIDQ5444966

Jacques Duparc, Filip Murlak

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_23

Mathematics Subject Classification ID

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

Related Items (10)

Index Problems for Game Automata ⋮ Unnamed Item ⋮ On the Weak Index Problem for Game Automata ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the separation question for tree languages ⋮ On the Strength of Unambiguous Tree Automata ⋮ Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata ⋮ Wadge-Wagner hierarchies ⋮ A Characterisation of Pi^0_2 Regular Tree Languages ⋮ A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]

This page was built for publication: On the Topological Complexity of Weakly Recognizable Tree Languages