Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets

DOI10.1007/978-3-642-31585-5_13zbMath1367.68160OpenAlexW2160685099MaRDI QIDQ3167003

Thomas Place, Mikołaj Bojańczyk

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

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

Related Items (6)

Index Problems for Game Automata ⋮ Regular languages of thin trees ⋮ Unnamed Item ⋮ Algebra for trees ⋮ A Characterisation of Pi^0_2 Regular Tree Languages ⋮ An upper bound on the complexity of recognizable tree languages

This page was built for publication: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets