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

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

2012-04-24

arxiv.org/abs/1204.5368v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Join of R-trivial and L-trivial Monoids via Combinatorics on Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Join of R-trivial and L-trivial Monoids via Combinatorics on Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Join of R-trivial and L-trivial Monoids via Combinatorics on Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520018