ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
From MaRDI portal
Publication:3561120
DOI10.1142/S0218196710005595zbMath1196.68150OpenAlexW2017081972MaRDI QIDQ3561120
Publication date: 25 May 2010
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196710005595
pseudovarietiesfirst-order definabilitytree languagesrecognizabilityblock productLindström quantifierspreclones
Formal languages and automata (68Q45) Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70)
Related Items (5)
On Pseudovarieties of Forest Algebras ⋮ Algebraic recognizability of regular tree languages ⋮ Recognisability for algebras of infinite trees ⋮ Varieties ⋮ Weak Separation Problem for Tree Languages
Cites Work
- An algebraic characterization of frontier testable tree languages
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- Tree algebras and varieties of tree languages
- The kernel of monoid morphisms
- Closure of varieties of languages under products with counter
- General varieties of tree languages
- Logic, semigroups and automata on words
- Decomposition techniques for finite semigroups, using categories. I
- Decomposition techniques for finite semigroups, using categories. II
- Algebraic recognizability of regular tree languages
- Characterizing CTL-like logics on finite trees.
- Characterizing EF and EX tree logics
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- First-order properties of trees, star-free expressions, and aperiodicity
- Some results onC-varieties
- Finite Model Theory
This page was built for publication: ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
