Results 1 to 10 of about 73 (62)
The Order of Hypersubstitutions of Type (2,1) [PDF]
International Journal of Mathematics and Mathematical Sciences, 2011 Hypersubstitutions are mappings which map operation symbols to terms of the corresponding arities. They were introduced as a way of making precise the concept of a hyperidentity and generalizations to 𝑀-hyperidentities.
Tawhat Changphas, Wonlop Hemvong
doaj +5 more sources
Complexity of terms, composition, and hypersubstitution [PDF]
International Journal of Mathematics and Mathematical Sciences, 2003 We consider four useful measures of the complexity of a term: the maximum depth (usually called the depth), the minimum depth, the variable count, and the operation count.
Klaus Denecke, Shelly L. Wismath
doaj +5 more sources
The Order of Generalized Hypersubstitutions of Type τ=(2) [PDF]
International Journal of Mathematics and Mathematical Sciences, 2008 The order of hypersubstitutions, all idempotent elements on the monoid of all hypersubstitutions of type τ=(2) were studied by K. Denecke and Sh. L. Wismath and all idempotent elements on the monoid of all hypersubstitutions of type τ=(2,2) were studied ...
Wattapong Puninagool +1 more
doaj +3 more sources
Monoids of ND-Full Hypersubstitutions
Discussiones Mathematicae - General Algebra and Applications, 2019 An nd-full hypersubstitution maps any operation symbols to the set of full terms of type τn. Nd-full hypersubstitutions can be extended to mappings which map sets of full terms to sets of full terms.
Lekkoksung Somsak
doaj +2 more sources
Green’s Relations on Submonoids of Generalized Hypersubstitutions of Type (n)
Discussiones Mathematicae - General Algebra and Applications, 2021 A generalized hypersubstitution of type τ = (n) is a function which takes the n-ary operation symbol f to the term of the same type σ(f ) which does not necessarily preserve the arity. Let HypG(n) be the set of all these generalized hypersubstitutions of
Kunama Pornpimol, Leeratanavalee Sorasak
doaj +3 more sources
On nd-K* (n, r)-Full Hypersubstitutions
Discussiones Mathematicae - General Algebra and Applications, 2021 Based on the notion of K* (n, r)-full terms defined by the authors, nd- K* (n, r)-full hypersubstitutions are defined. It turns out that the extension of an nd- K* (n, r)-full hypersubstitution is an endomorphism of the algebra of tree languages of nd- K*
Wattanatripop Khwancheewa +1 more
doaj +3 more sources
Discussiones Mathematicae - General Algebra and Applications, 2021 The main purpose of this paper is to generalize the concept of linear terms. A linear term is a term in which every variable occurs at most once. K. Denecke defined partial operations on linear terms and partial clones.
Lekkoksung Nareupanat, Lekkoksung Somsak
doaj +2 more sources
The Depth of a Hypersubstitution
J. Autom. Lang. Comb., 2001 For given depths of the terms $s,t_1,\ldots,t_n$ a formula will be proved to calculate the depth of the composed term $s(t_1,\ldots,t_n)$ and if $\sigma$ is a hypersubstitution and $t$ is a term we derive a formula for the depth of $\hat\sigma[t]$.
Denecke, Klaus-Dieter +2 more
openaire +5 more sources
MULTI-HYPERSUBSTITUTIONS AND COLORED SOLID VARIETIES [PDF]
International Journal of Algebra and Computation, 2006 Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by operation symbols and by colors, i.e. certain positive integers.
Denecke, Klaus-Dieter +2 more
openaire +2 more sources
Idempotent Elements of Weak Projection Generalized Hypersubstitutions
Discussiones Mathematicae - General Algebra and Applications, 2018 A generalized hypersubstitution of type τ = (ni)i∈I is a mapping σ which maps every operation symbol fi to the term σ (fi) and may not preserve arity.
Lekkoksung Nareupanat, Jampachon Prakit
doaj +1 more source