On topological completeness of regular tree languages

DOI10.1007/978-3-642-29485-3_11MaRDI QIDQ2897950zbMATH OpenOpenAlexFDO

Authors Henryk Michalewski, Damian Niwiński

Publication date 16 July 2012

Published in Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29485-3_11

zbMATH Keywords

alternating automata on infinite treesindex hierarchyseparation property

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Descriptive set theory (03E15)

Recommendations

• On the separation question for tree languages
• On the Topological Complexity of Weakly Recognizable Tree Languages
• On the separation question for tree languages
• Continuous separation of game languages
• On recognizable tree languages beyond the Borel hierarchy

Cited in

(6)

• Test sets for the universal and existential closure of regular tree languages.
• On the separation question for tree languages
• Measure properties of regular sets of trees
• Measure Properties of Game Tree Languages
• The topological structure of adherences of regular languages
• The congruence theory of closure properties of regular tree languages

This page was built for publication: On topological completeness of regular tree languages

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