License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.126
URN: urn:nbn:de:0030-drops-107028
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10702/
Place, Thomas ;
Zeitoun, Marc
On All Things Star-Free
Abstract
We investigate the star-free closure, which associates to a class of languages its closure under Boolean operations and marked concatenation. We prove that the star-free closure of any finite class and of any class of groups languages with decidable separation (plus mild additional properties) has decidable separation. We actually show decidability of a stronger property, called covering. This generalizes many results on the subject in a unified framework. A key ingredient is that star-free closure coincides with another closure operator where Kleene stars are also allowed in restricted contexts.
BibTeX - Entry
@InProceedings{place_et_al:LIPIcs:2019:10702,
author = {Thomas Place and Marc Zeitoun},
title = {{On All Things Star-Free}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {126:1--126:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10702},
URN = {urn:nbn:de:0030-drops-107028},
doi = {10.4230/LIPIcs.ICALP.2019.126},
annote = {Keywords: Regular languages, separation problem, star-free closure, group languages}
}
|
Keywords: |
|
Regular languages, separation problem, star-free closure, group languages |
|
Collection: |
|
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
04.07.2019 |
