Results 181 to 190 of about 532 (202)
Some of the next articles are maybe not open access.
Inverse Monoids With a Natural Semilattice Ordering
Proceedings of the London Mathematical Society, 1995The thesis of this paper is that many naturally occurring examples of inverse semigroups are endowed with extra structure; typically, they are inverse monoids in which the natural partial order forms a meet semilattice. Inverse semigroups of this kind the author terms inverse algebras.
openaire +2 more sources
Orbit decompositions of orthogonal monoids and the orders of finite orthogonal monoids
Semigroup Forum, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cao, You'an, Li, Zhenheng, Lei, Jie
openaire +1 more source
Residuation in commutative ordered monoids with minimal zero [PDF]
Reports Math. Log., 2000 The authors define a new algebraic system called semi-integral residuated commutative monoid (sircomonoid). An algebra \(B= \langle B;\oplus,\mathop{\dot-},0\rangle\) of type \(\langle 2,2,0\rangle\) is called a sircomonoid if it satisfies that for \(a,b,c\in B\), (i) \(\langle B;\oplus,0\rangle\) is a commutative monoid; (ii) the relation \(\leq ...
James G. Raftery 0001 +1 more
openaire +1 more source
DISCRETE ORDERINGS AND COMMUTATIVE MONOIDS
Communications in Algebra, 2001We show that a countable totally and discretely ordered set with first element inherently carries the structure of an ordered commutative euclidean monoid, provided its order type is of a certain kind. As an application we specify the order types of all discretely ordered sets which can be expanded to ordered commutative euclidean monoids.
openaire +1 more source
And... Action! – Monoid Actions and (Pre)orders
2014Orders occur naturally in many areas of computer science and mathematics. In several cases it is very simple do describe an order mathematically, but it may be cumbersome to implement in some programming language. On the other hand many order relations are defined in terms of an existential quantification.
openaire +1 more source
Faithful Loops for Aperiodic E-Ordered Monoids
2009One of the main objectives of the algebraic theory of regular languages concerns the classification of regular languages based on Eilenberg's variety theorem [10]. This theorem states that there exists a bijection between varieties of regular languages and varieties of finite monoids. For example, the variety of star-free regular languages (the closure
Martin Beaudry, François Lemieux
openaire +1 more source
Remark on the identities of the grammic monoid with three generators
Semigroup Forum, 2022M V Volkov
exaly
Fuzzy Automata Based on Lattice-ordered Monoid with Algebraic and Topological Aspects
Fuzzy Information and Engineering, 2012Shambhu Sharan
exaly
A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ
Order, 2018Hans-Jürgen Bandelt +2 more
exaly