Skip to main content
Conference Proceedings

Star-free languages and local divisors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8614 LNCS 23-28
DOI: 10.1007/978-3-319-09704-6_3
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A celebrated result of Schützenberger says that a language is star-free if and only if it is is recognized by a finite aperiodic monoid. We give a new proof for this theorem using local divisors. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Kufleitner, M. (2014). Star-free languages and local divisors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 23–28). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_3

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