Results 111 to 120 of about 34,808 (248)
Semigroup Forum, 1979 We introduce here objects which appear naturally in the study of the syntactic monoids of non rational languages: the pairs consisting of a monoid together with a distinguished subset. Elementary properties of syntactic monoids are derived from theorems of universal algebra on the objects.
openaire +3 more sources
On Ideals of Submonoids of Power Monoids
MathematicsLet S be a numerical monoid, while a Pfin(S)-monoid S is a monoid generated by a finite number of finite non-empty subsets of S. That is, S is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets.
Juan Ignacio García-García +2 more
doaj +1 more source
Endomorphism monoids of distributive double p-algebras [PDF]
, 1979 M. E. Adams, J. Sichler
openalex +1 more source
Algebraic monoids whose nonunits are products of idempotents [PDF]
, 1988 Mohan S. Putcha
openalex +2 more sources
An algebraic model for inversion and deletion in bacterial genome rearrangement. [PDF]
J Math Biol, 2023 Clark C +3 more
europepmc +1 more source
Hilbert series of right-angled affine Artin monoid $M(\widetilde{A}^{\infty}_{n})$
Kuwait Journal of Science, 2017 It is already proved that the growth rate of all the spherical Artin monoids is less than 4. In this paper, we find the Hilbert series of the associated right-angled affine Artin monoid M and also we discuss the recurrence relations and the growth of ...
Zaffar Iqbal +2 more
doaj
Algebraic Structures Of Neutrosophic Soft Sets [PDF]
Neutrosophic Sets and Systems, 2015 In this paper, we study the algebraic operations of neutrosophic soft sets and their basic properties associated with these opertaions. And also define the associativity and distributivity of these operations.
Asim Hussain, Muhammad Shabir
doaj
Electronic Notes in Theoretical Computer Science, 2010 AbstractThe Cartesian monoid of partial piecewise shift operators is developed as a model for programming systems such as Backus' FP. Special attention is paid to those elements which are equationally implicitly definable.
openaire +2 more sources
End-regular and End-orthodox generalized lexicographic products of bipartite graphs
Open Mathematics, 2016 A graph X is said to be End-regular (End-orthodox) if its endomorphism monoid End(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.
Gu Rui, Hou Hailong
doaj +1 more source