Results 1 to 10 of about 198 (35)
Join Irreducible 2-Testable Semigroups
A nontrivial pseudovariety is join irreducible if whenever it is contained in the complete join of some collection of pseudovarieties, then it is contained in one of the pseudovarieties.
Lee Edmond W.H.
doaj +1 more source
Green’s Relations on Submonoids of Generalized Hypersubstitutions of Type (n)
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 +1 more source
Factoriality and the Pin-Reutenauer procedure [PDF]
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature ...
J. Almeida, J. C. Costa, M. Zeitoun
doaj +1 more source
On the insertion of n-powers [PDF]
In algebraic terms, the insertion of $n$-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality $1\le x^n$.
J. Almeida, O. Klíma
doaj +1 more source
Chains and anti-chains in the lattice of epigroup varieties [PDF]
Let $\mathcal E_n$ be the variety of all epigroups of index $\le n$. We prove that, for an arbitrary natural number $n$, the interval $[\mathcal E_n, \mathcal E_{n+1}]$ of the lattice of epigroup varieties contains a chain isomorphic to the chain of real
Skokov, D. V., Vernikov, B. M.
core +3 more sources
Special elements of the lattice of monoid varieties [PDF]
We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a completely regular ...
Gusev, S. V.
core +1 more source
An introduction of F‐graphs, a graph‐theoretic representation of natural numbers
A special type of family graphs (F‐graphs, for brevity) are introduced. These are cactus‐type graphs which form infinite families under an attachment operation. Some of the characterizing properties of F‐graphs are discussed. Also, it is shown that, together with the attachment operation, these families form an infinite, commutative semigroup with unit
E. J. Farrell
wiley +1 more source
On some varieties of ai-semirings satisfying xp+1 ≈ x
The aim of this paper is to study the lattice of subvarieties of the ai-semiring variety defined by the additional ...
Wang Aifa, Shao Yong
doaj +1 more source
The semaphore codes attached to a Turing machine via resets and their various limits [PDF]
We introduce semaphore codes associated to a Turing machine via resets. Semaphore codes provide an approximation theory for resets. In this paper we generalize the set-up of our previous paper "Random walks on semaphore codes and delay de Bruijn ...
Rhodes, John +2 more
core +3 more sources
Completely Archimedean Semirings
In this paper we give a structural description of completely Archimedean semirings which is an extension of the structure theorem of completely Archimedean semigroups.
Maity Sunil K., Chatterjee Rumpa
doaj +1 more source

