Star-free languages and local divisors
Formal Languages and Automata Theory
2014-08-14 v1
Abstract
A celebrated result of Sch\"utzenberger 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.
Cite
@article{arxiv.1408.2842,
title = {Star-free languages and local divisors},
author = {Manfred Kufleitner},
journal= {arXiv preprint arXiv:1408.2842},
year = {2014}
}
Comments
This is a prior version of an invited contribution at the 16th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2014) in Turku, Finland. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-09704-6_3