2000 character limit reached
Star-free languages and local divisors (1408.2842v1)
Published 12 Aug 2014 in cs.FL
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.