Refine
Has Fulltext
- no (1) (remove)
Year of publication
- 2019 (1)
Document Type
- Article (1)
Language
- English (1)
Is part of the Bibliography
- yes (1)
Keywords
- partial clone (1) (remove)
Institute
A term, also called a tree, is said to be linear, if each variable occurs in the term only once. The linear terms and sets of linear terms, the so-called linear tree languages, play some role in automata theory and in the theory of formal languages in connection with recognizability. We define a partial superposition operation on sets of linear trees of a given type and study the properties of some many-sorted partial clones that have sets of linear trees as elements and partial superposition operations as fundamental operations. The endomorphisms of those algebras correspond to nondeterministic linear hypersubstitutions.