General varieties of tree languages
Theoretical Computer Science
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Positive varieties of tree languages
Theoretical Computer Science
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
M-solid varieties of languages
Acta Cybernetica
Algebra for Infinite Forests with an Application to the Temporal Logic EF
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An algebraic proof of Rabin's Tree Theorem
Theoretical Computer Science
Algebras, automata and logic for languages of labeled birooted trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 5.23 |
We develop an algebraic language theory for languages of infinite trees. We define a class of algebras called @w-hyperclones and we show that a language of infinite trees is regular if, and only if, it is recognised by a finitary path-continuous @w-hyperclone.