Star-free languages and local divisors
conference contribution
posted on 2018-02-23, 14:55 authored by Manfred KufleitnerA 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.
Funding
This work was supported by the German Research Foundation (DFG) under grant DI 435/5-1 and the support by ANR 2010 BLAN 0202 FREC.
History
School
- Science
Department
- Computer Science
Published in
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Volume
8614 LNCSPages
23 - 28Citation
KUFLEITNER, M., 2014. Star-free languages and local divisors. IN: Jurgensen, H., Karhumaki, J. and Okhotin, A. (eds.) Descriptional Complexity of Formal Systems, 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings. Chaim: Springer, pp. 23-28.Publisher
© SpringerVersion
- AM (Accepted Manuscript)
Publisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Publication date
2014Notes
This is a pre-copyedited version of a contribution published in Jurgensen, H., Karhumaki, J. and Okhotin, A. (eds.) Descriptional Complexity of Formal Systems, 16th International Workshop, DCFS 2014, published by Springer International. The definitive authenticated version is available online via https://doi.org/10.1007/978-3-319-09704-6_3ISBN
9783319097039ISSN
0302-9743eISSN
1611-3349Publisher version
Book series
Lecture Notes in Computer Science;8614Language
- en
