scientific article; zbMATH DE number 5005936
From MaRDI portal
Publication:3365845
Recommendations
- Algebraic recognizability of regular tree languages
- Algebras for classifying regular tree languages and an application to frontier testability
- Tree algebras and varieties of tree languages
- Varieties of regular algebras and unranked tree languages
- Algebraic characterization of logically defined tree languages
- Tree algebra of sofic tree languages
- Regular tree languages and quasi orders
- Regular languages of thin trees
- Regular languages of thin trees
Cited in
(22)- Generalized contexts and \(n\)-ary syntactic semigroups of tree languages.
- Varieties of recognizable tree series over fields
- Recognisability for algebras of infinite trees
- Regular languages of thin trees
- On DR tree automata, unary algebras and syntactic path monoids
- Tree languages with fixed variables and their algebraic structures
- Rectangular algebras as tree recognizers
- scientific article; zbMATH DE number 3577165 (Why is no real title available?)
- Algebras for classifying regular tree languages and an application to frontier testability
- Algebra for trees
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- scientific article; zbMATH DE number 480524 (Why is no real title available?)
- Tree algebras and varieties of tree languages
- Regular tree languages and quasi orders
- Algebras, automata and logic for languages of labeled birooted trees
- Varieties of regular algebras and unranked tree languages
- Weak separation problem for tree languages
- Varieties of many-sorted recognizable sets
- Algebraic recognizability of regular tree languages
- Congruence-based proofs of the recognizability theorems for free many-sorted algebras
- Classes of tree languages determined by classes of monoids
- Mathematical Foundations of Computer Science 2003
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3365845)
