The Partial Clone of Linear Tree Languages
- Autores: Lekkoksung N.1,2, Denecke K.1,2
-
Afiliações:
- University of Potsdam, Institute of Mathematics
- KhonKaen University, Department of Mathematics
- Edição: Volume 60, Nº 3 (2019)
- Páginas: 497-507
- Seção: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/172433
- DOI: https://doi.org/10.1134/S0037446619030121
- ID: 172433
Citar
Resumo
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.
Sobre autores
N. Lekkoksung
University of Potsdam, Institute of Mathematics; KhonKaen University, Department of Mathematics
Email: klausdenecke@hotmail.com
Alemanha, Potsdam; KhonKaen
K. Denecke
University of Potsdam, Institute of Mathematics; KhonKaen University, Department of Mathematics
Autor responsável pela correspondência
Email: klausdenecke@hotmail.com
Alemanha, Potsdam; KhonKaen