On the separation question for tree languages

DOI10.4230/LIPICS.STACS.2012.396MaRDI QIDQ2904779zbMATH OpenFDO

Authors Henryk Michalewski, André Arnold, Damian Niwiński

Publication date 23 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2012.396

zbMATH Keywords

alternating automata on infinite treesindex hierarchyseparation property

Mathematics Subject Classification ID

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

Recommendations

• On the separation question for tree languages
• Continuous separation of game languages
• On the Borel inseparability of game tree languages
• A gap property of deterministic tree languages.
• Rabin-Mostowski index problem: a step beyond deterministic automata

Cited in

(11)

• Separating \(k\)-separated eNCE graph languages
• On the separation question for tree languages
• On topological completeness of regular tree languages
• Topological extension of parity automata
• On the strength of unambiguous tree automata
• Rabin-Mostowski index problem: a step beyond deterministic automata
• scientific article; zbMATH DE number 222345 (Why is no real title available?)
• On the Borel inseparability of game tree languages
• Separation property for B- and S-regular languages
• Continuous separation of game languages
• On the separability of sparse context-free languages and of bounded rational relations

This page was built for publication: On the separation question for tree languages

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