Recognisability for algebras of infinite trees

DOI10.1016/j.tcs.2011.02.037zbMath1233.68159OpenAlexW2011892490MaRDI QIDQ551167

Achim Blumensath

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.037

zbMATH Keywords

monadic second-order logicformal languagestree automatainfinite treesrecognizable sets

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70)

Related Items (7)

Regular languages of thin trees ⋮ Algebra for Infinite Forests with an Application to the Temporal Logic EF ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algebra for trees ⋮ On labeled birooted tree languages: algebras, automata and logic

Cites Work

• Tree algebras and varieties of tree languages
• General varieties of tree languages
• Algebraic recognizability of regular tree languages
• Characterizing CTL-like logics on finite trees.
• Positive varieties of tree languages
• Algebra for Infinite Forests with an Application to the Temporal Logic EF
• ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
• Algebras for classifying regular tree languages and an application to frontier testability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognisability for algebras of infinite trees