On Topological Completeness of Regular Tree Languages

DOI10.1007/978-3-642-29485-3_11zbMath1354.03052OpenAlexW203084670MaRDI QIDQ2897950

Henryk Michalewski, Damian Niwinski

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

separation propertyalternating automata on infinite treesindex hierarchy

Mathematics Subject Classification ID

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

Related Items (2)

Measure Properties of Game Tree Languages ⋮ Measure properties of regular sets of trees

This page was built for publication: On Topological Completeness of Regular Tree Languages