Faithful loops for aperiodic e-ordered monoids (Extended Abstract)

0Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One 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 of finite languages under Boolean operations and concatenation) is related to the monoid variety of aperiodic monoids (those with no nontrivial subgroups)[21]. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Beaudry, M., & Lemieux, F. (2009). Faithful loops for aperiodic e-ordered monoids (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5556 LNCS, pp. 55–66). https://doi.org/10.1007/978-3-642-02930-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free