TY  - JOUR
A1  - Lekkoksung, Nareupanat
A1  - Denecke, Klaus-Dieter
T1  - The partial clone of linear tree languages
JF  - Siberian mathematical journal
N2  - 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.
KW  - linear term
KW  - linear tree language
KW  - clone
KW  - partial clone
KW  - linear hypersubstitution
KW  - nondeterministic linear hypersubstitution
Y1  - 2019
U6  - https://doi.org/10.1134/S0037446619030121
SN  - 0037-4466
SN  - 1573-9260
VL  - 60
IS  - 3
SP  - 497
EP  - 507
PB  - Pleiades Publ.
CY  - New York
ER  -