scientific article
From MaRDI portal
Publication:3221429
zbMath0557.68051MaRDI QIDQ3221429
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
chainsregular tree languagesantichainstree automatatree languagesaperiodicitysyntactic monoidsstar-free languagesmonadic second-order definabilitym-theories
Formal languages and automata (68Q45) Model theory (03C99) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Modulo-counting quantifiers over finite trees, The inference of tree languages from finite samples: An algebraic approach, Matching regular expressions on uncertain data, Rabin tree automata and finite monoids, First-order properties of trees, star-free expressions, and aperiodicity, Axiomatizing the equational theory of regular tree languages, The monadic second-order logic of graphs. X: Linear orderings, Deterministic top-down tree automata with Boolean deterministic look-ahead, Tree algebras and varieties of tree languages, Deciding equivalence of finite tree automata, Test sets for the universal and existential closure of regular tree languages., Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages, Aperiodicity in Tree Automata, Operator precedence temporal logic and model checking, Algebras for classifying regular tree languages and an application to frontier testability, Codes and equations on trees, Games for Temporal Logics on Trees, Unnamed Item, On reverse and general definite tree languages, Automata on finite trees, Algebra for trees, Positive varieties of tree languages
