The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2012

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

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.
Fichier principal
Vignette du fichier
2081-6947-2-PB.pdf (96.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00992870 , version 1 (19-05-2014)

Identifiers

Cite

Manfred Kufleitner, Alexander Lauser. The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.141-146. ⟨10.46298/dmtcs.564⟩. ⟨hal-00992870⟩

Collections

TDS-MACS
81 View
757 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More