@article{LekkoksungDenecke2019,
  author    = {Lekkoksung, Nareupanat and Denecke, Klaus-Dieter},
  title     = {The partial clone of linear tree languages},
  series = {Siberian mathematical journal},
  volume    = {60},
  journal   = {Siberian mathematical journal},
  number    = {3},
  publisher = {Pleiades Publ.},
  address   = {New York},
  issn      = {0037-4466},
  doi       = {10.1134/S0037446619030121},
  pages     = {497 -- 507},
  year      = {2019},
  abstract  = {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.},
  language  = {en}
}
@article{Denecke2020,
  author    = {Denecke, Klaus-Dieter},
  title     = {Partial clones},
  series = {Asian-European journal of mathematics : AEJM},
  volume    = {13},
  journal   = {Asian-European journal of mathematics : AEJM},
  number    = {8},
  publisher = {World Scientific},
  address   = {Singapore},
  issn      = {1793-5571},
  doi       = {10.1142/S1793557120501612},
  pages     = {19},
  year      = {2020},
  abstract  = {A set C of operations defined on a nonempty set A is said to be a clone if C is closed under composition of operations and contains all projection mappings. The concept of a clone belongs to the algebraic main concepts and has important applications in Computer Science. A clone can also be regarded as a many-sorted algebra where the sorts are the n-ary operations defined on set A for all natural numbers n >= 1 and the operations are the so-called superposition operations S-m(n) for natural numbers m, n >= 1 and the projection operations as nullary operations. Clones generalize monoids of transformations defined on set A and satisfy three clone axioms. The most important axiom is the superassociative law, a generalization of the associative law. If the superposition operations are partial, i.e. not everywhere defined, instead of the many-sorted clone algebra, one obtains partial many-sorted algebras, the partial clones. Linear terms, linear tree languages or linear formulas form partial clones. In this paper, we give a survey on partial clones and their properties.},
  language  = {en}
}