The partial clone of linear tree languages
From MaRDI portal
Publication:2332072
Here, a tree means a term. It is called linear if every variable occurs only once. The authors define a partial superposition operation on a set of linear trees of a given type and study properties of some many-sorted partial clones that have sets of linear trees as elements and partial superpositions as fundamental operations. They prove that endomorphisms of these algebras correspond to nondeterministic linear hypersubstitutions studied by the authors in a series of previous papers.
Recommendations
- On inferring linear single-tree languages
- Semigroups of linear tree languages
- A generalized superposition of linear tree languages and products of linear tree languages
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
- Semi-linearity, Parikh-boundedness and tree adjunct languages
- scientific article; zbMATH DE number 475413
- A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
Cites work
Cited in
(8)- The partial clone of linear formulas
- On inferring linear single-tree languages
- The partial clone of linear terms
- A generalized superposition of linear tree languages and products of linear tree languages
- Clone of linear terms and clone of linear formulas
- On partial clones of \(k\)-terms
- Partial clones
- The partial clone of completely expanded terms
This page was built for publication: The partial clone of linear tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332072)