Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The Join of the Vari ...
Article

The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words

Manfred Kufleitner ORCID (1) (2), Alexander Lauser (1) (2)
(1) University of Stuttgart
(2) University of Stuttgart = Universität Stuttgart
Download article
Open on HAL
Imported on
January 9, 2012
Published on
June 24, 2012
Last modified on
March 31, 2025
Volume 14
vol. 14:1
Automata, Logic and Semantics
DOI
10.46298/dmtcs.564
License
https://about.hal.science/hal-authorisation-v1
Indicators
1153
Views
798
Downloads

The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words

Manfred Kufleitner ORCID (1) (2), Alexander Lauser (1) (2)
(1) University of Stuttgart
(2) University of Stuttgart = Universität Stuttgart
Abstract
The join of two varieties is the smallest variety containing both. In finite semigroup theory, the varieties of R-trivial and L-trivial monoids are two of the most prominent classes of finite monoids. Their join is known to be decidable due to a result of Almeida and Azevedo. In this paper, we give a new proof for Almeida and Azevedo's effective characterization of the join of R-trivial and L-trivial monoids. This characterization is a single identity of omega-terms using three variables.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Preview
Loading PDF preview...