A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]

DOI10.1007/978-3-319-19225-3_7zbMath1432.68225OpenAlexW2251723426MaRDI QIDQ5500683

Jacques Duparc, Kevin B. Fournier

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_7

Mathematics Subject Classification ID

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

Cites Work

• Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
• On Recognizable Tree Languages Beyond the Borel Hierarchy
• On the Topological Complexity of Weakly Recognizable Tree Languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Rudiments of \(\mu\)-calculus
• Unnamed Item
• Unnamed Item

This page was built for publication: A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]