Regular languages of thin trees

DOI10.1007/s00224-014-9595-zzbMath1350.68173DBLPjournals/mst/IdziaszekSB16OpenAlexW2036628157WikidataQ59472496 ScholiaQ59472496MaRDI QIDQ290908

Tomasz Idziaszek, Michał Skrzypczak, Mikołaj Bojańczyk

Publication date: 3 June 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/3965/

zbMATH Keywords

topological complexityregular languageseffective characterizationsinfinite trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algebra for trees

Cites Work

• Recognisability for algebras of infinite trees
• The Borel hierarchy is infinite in the class of regular sets of trees
• A gap property of deterministic tree languages.
• Interpretations in Trees with Countably Many Branches
• Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
• Algebra for Infinite Forests with an Application to the Temporal Logic EF
• On Recognizable Tree Languages Beyond the Borel Hierarchy
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• Uniformization and skolem functions in the class of trees
• On finite monoids having only trivial subgroups
• On the Borel Inseparability of Game Tree Languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• The Wadge Hierarchy of Deterministic Tree Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular languages of thin trees