A tentative approach for the Wadge-Wagner hierarchy of regular tree languages of index [0,2]

DOI10.1007/978-3-319-19225-3_7MaRDI QIDQ5500683zbMATH OpenOpenAlexFDO

Authors Jacques Duparc, Kevin 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

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

Recommendations

• On unambiguous regular tree languages of index (0,2)
• The Wadge Hierarchy of Deterministic Tree Languages
• The Wadge Hierarchy of Deterministic Tree Languages
• Regular tree languages in low levels of the Wadge hierarchy
• Continuous separation of game languages

Cites work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 3609660 (Why is no real title available?)
• On recognizable tree languages beyond the Borel hierarchy
• On the Topological Complexity of Weakly Recognizable Tree Languages
• Rudiments of \(\mu\)-calculus
• Wadge degrees and pointclasses. Introduction to Part III
• Wadge hierarchy and Veblen hierarchy. I: Borel sets of finite rank

Cited in

(6)

• THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Regular tree languages in low levels of the Wadge hierarchy
• On unambiguous regular tree languages of index (0,2)
• The Wadge Hierarchy of Deterministic Tree Languages
• The Wadge Hierarchy of Deterministic Tree Languages

This page was built for publication: A tentative approach for the Wadge-Wagner hierarchy of regular tree languages of index \([0,2]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500683)