Results 11 to 20 of about 733,709 (66)
The Order of Hypersubstitutions of Type (2,1) [PDF]
International Journal of Mathematics and Mathematical Sciences, Volume 2011, Issue 1, 2011., 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 M‐hyperidentities. A variety in which every identity is satisfied as a hyperidentity is called solid.
Tawhat Changphas +2 more
wiley +2 more sources
M-strongly solid monoids of generalized hypersubstitutions of type τ = (2) [PDF]
Surveys in Mathematics and its Applications, 2013 The purpose of this paper is to characterize M-strongly solid monoids of generalized hypersubstitutions of type τ=(2) which is the extension of M-solid monoids of hypersubstitutions of the same type.
Sivaree Sudsanit, Sorasak Leeratanavalee
doaj +1 more source
On nd-K*(n, r)-Full Hypersubstitutions [PDF]
, 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*(n, r)
Changphas, Thawhat +1 more
core +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2012 A generalized hypersubstitution of type τ = (2) is a mapping which maps the binary operation symbol f to a term σ(f) which does not necessarily preserve the arity. Any such σ can be inductively extended to a map σ̂ on the set of all terms of type τ = (2),
Puninagool Wattapong +1 more
doaj +1 more source
All Maximal Completely Regular Submonoids of HypG(2)
Discussiones Mathematicae - General Algebra and Applications, 2017 In this paper we consider mappings σ which map the binary operation symbol f to the term σ (f) which do not necessarily preserve the arity. These mapping are called generalized hypersubstitutions of type τ = (2) and we denote the set of all these ...
Kunama Pornpimol, Leeratanavalee Sorasak
doaj +1 more source
Unsolid and fluid strong varieties of partial algebras
International Journal of Mathematics and Mathematical Sciences, Volume 2006, Issue 1, 2006., 2006 A partial algebra 𝒜=(A;(fiA) i∈I) consists of a set A and an indexed set (fiA) i∈I of partial operations fiA:Ani⊸→A. Partial operations occur in the algebraic description of partial recursive functions and Turing machines. A pair of terms p ≈ q over the partial algebra 𝒜 is said to be a strong identity in 𝒜 if the right‐hand side is defined whenever ...
S. Busaman, K. Denecke
wiley +1 more source
Tree transformations defined by hypersubstitutions [PDF]
, 2001 Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the
Denecke, Klaus, Arworn, Sr.
core +1 more source
The Relationship between Some Regular Subsemigroups of HypG2
Journal of Mathematics, 2014 The concept of regular subsemigroups plays an important role in the theory of semigroup. In this work, we study the relationship between some regular subsemigroups on the monoid of all generalized hypersubstitutions of type τ=(2).
Weerapong Wongpinit +1 more
doaj +1 more source
Complexity of hypersubstitutions and lattices of varieties [PDF]
, 2003 Hypersubstitutions are mappings which map operation symbols to terms. The set of all hypersubstitutions of a given type forms a monoid with respect to the composition of operations.
Denecke, Klaus, Changphas, Thawhat
core +1 more source
Maximal submonoids of monoids of hypersubstitutions [PDF]
, 2006 For a monoid M of hypersubstitutions, the collection of all M-solid varieties forms a complete sublattice of the lattice L(τ) of all varieties of a given type τ.
Koppitz, Jörg, Dimitrova, Ilinka
core +1 more source