Regular languages of infinite trees that are Boolean combinations of open sets

DOI10.1007/978-3-642-31585-5_13MaRDI QIDQ3167003zbMATH OpenOpenAlexFDO

Authors Mikołaj Bojańczyk, Thomas Place

Publication date 1 November 2012

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31585-5_13

Mathematics Subject Classification ID

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

Recommendations

• Boolean algebras of regular languages
• scientific article; zbMATH DE number 3993563
• Regular tree languages in low levels of the Wadge hierarchy
• Regular ideal languages and their Boolean combinations
• The Boolean algebra of piecewise testable languages

Cited in

(9)

• Definable Boolean combinations of open sets are Boolean combinations of open definable sets
• Algebra for trees
• Regular languages of thin trees
• Regular ideal languages and their Boolean combinations
• A Characterisation of Pi^0_2 Regular Tree Languages
• Regular tree languages in low levels of the Wadge hierarchy
• Index problems for game automata
• An upper bound on the complexity of recognizable tree languages
• Deterministic and game separability for regular languages of infinite trees

This page was built for publication: Regular languages of infinite trees that are Boolean combinations of open sets

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