The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Combinatorics on traces
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
An algebraic characterization of frontier testable tree languages
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Basic notions of universal algebra for language theory and graph grammars
Theoretical Computer Science
Handbook of formal languages, vol. 3
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
General varieties of tree languages
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Universal Algebra and Applications in Theoretical Computer Science
Universal Algebra and Applications in Theoretical Computer Science
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Varieties Of Formal Languages
First-Order Properties of Trees, Star-Free Expressions, adn Aperiodicity
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
First-Order Logic on Finite Trees
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Modulo Counting Quantifiers Over Finite Trees
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Regular tree languages and quasi orders
Acta Cybernetica
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Decidable Characterization of Locally Testable Tree Languages
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Fuzzy tree language recognizability
Fuzzy Sets and Systems
Recognisability for algebras of infinite trees
Theoretical Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Hi-index | 0.00 |
We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Σ-algebra or minimal tree automaton, but adds new expressivity to it. The main result in this paper is a variety theorem à la Eilenberg, but we also discuss important examples of logically defined classes of recognizable tree languages, whose characterization and decidability was established in recent papers (by Benedikt and Ségoufin, and by Bojanczyk and Walukiewicz) and can be naturally formulated in terms of pseudovarieties of preclones. Finally, this paper constitutes the foundation for another paper by the same authors, where first-order definable tree languages receive an algebraic characterization.