Recognisability for algebras of infinite trees
From MaRDI portal
Publication:551167
DOI10.1016/j.tcs.2011.02.037zbMath1233.68159MaRDI QIDQ551167
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
03B70: Logic in computer science
08A70: Applications of universal algebra in computer science
68Q70: Algebraic theory of languages and automata
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Regular languages of thin trees, On labeled birooted tree languages: algebras, automata and logic, Algebra for Infinite Forests with an Application to the Temporal Logic EF
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