On the pseudovariety generated by all finite monoids satisfying R = H

2015 ◽  
Vol 288 (S1) ◽  
pp. 156-161 ◽  
Author(s):  
T. V. Pervukhina
Keyword(s):  
Finite Monoids

scholarly journals Partially ordered finite monoids and a theorem of I. Simon

1988 ◽  
Vol 119 (2) ◽  
pp. 393-399 ◽  
Author(s):  
Howard Straubing ◽  
Denis Thérien
Keyword(s):  
Partially Ordered ◽  
Finite Monoids

scholarly journals EMBEDDINGS IN COSET MONOIDS

2008 ◽  
Vol 85 (1) ◽  
pp. 75-80
Author(s):  
JAMES EAST
Keyword(s):  
Semigroup Forum ◽  
Inverse Semigroup ◽  
Simple Proof ◽  
Inverse Semigroups ◽  
Sufficient Condition ◽  
Simple Description ◽  
Group Of Units ◽  
Finite Monoids ◽  
Finite Set ◽  
Symmetric Inverse Semigroup

AbstractA submonoid S of a monoid M is said to be cofull if it contains the group of units of M. We extract from the work of Easdown, East and FitzGerald (2002) a sufficient condition for a monoid to embed as a cofull submonoid of the coset monoid of its group of units, and show further that this condition is necessary. This yields a simple description of the class of finite monoids which embed in the coset monoids of their group of units. We apply our results to give a simple proof of the result of McAlister [D. B. McAlister, ‘Embedding inverse semigroups in coset semigroups’, Semigroup Forum20 (1980), 255–267] which states that the symmetric inverse semigroup on a finite set X does not embed in the coset monoid of the symmetric group on X. We also explore examples, which are necessarily infinite, of embeddings whose images are not cofull.

Which finite monoids are syntactic monoids of rational ω-languages

1992 ◽  
Vol 42 (3) ◽  
pp. 127-132 ◽  
Author(s):  
Phan Trung Huy ◽  
Igor Livotsky ◽  
Do Long Van
Keyword(s):  
Finite Monoids
Sign in / Sign up

Export Citation Format

Share Document