Continuous separation of game languages

MaRDI QIDQ5445157zbMATH OpenFDO

Authors André Arnold, Damian Niwiński

Publication date 3 March 2008

zbMATH Keywords

hierarchyrecognizabilityseparationtopological complexityWadge reducibilitytree languages

Mathematics Subject Classification ID

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

Recommendations

• On the Borel inseparability of game tree languages
• On the separation question for tree languages
• On the separation question for tree languages
• On recognizable tree languages beyond the Borel hierarchy
• The Wadge Hierarchy of Deterministic Tree Languages

Cited in

(12)

• Monoidal-closed categories of tree automata
• On the separation question for tree languages
• \(k\)-bounded Petri net synthesis from modal transition systems
• Measure properties of regular sets of trees
• Index problems for game automata
• Unambiguous languages exhaust the index hierarchy
• A tentative approach for the Wadge-Wagner hierarchy of regular tree languages of index \([0,2]\)
• On the separation question for tree languages
• On the Borel inseparability of game tree languages
• Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
• Measure Properties of Game Tree Languages
• On topological completeness of regular tree languages

This page was built for publication: Continuous separation of game languages

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