Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/31986

Title: Star-free languages and local divisors
Authors: Kufleitner, Manfred
Issue Date: 2014
Publisher: © Springer
Citation: 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.
Series/Report no.: Lecture Notes in Computer Science;8614
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.
Description: 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_3
Sponsor: 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.
Version: Accepted for publication
DOI: 10.1007/978-3-319-09704-6_3
URI: https://dspace.lboro.ac.uk/2134/31986
Publisher Link: https://doi.org/10.1007/978-3-319-09704-6_3
ISBN: 9783319097039
ISSN: 0302-9743
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
si_dcfs2014.pdfAccepted version218.45 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.