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.2018.137
URN: urn:nbn:de:0030-drops-91419
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9141/
Place, Thomas ;
Zeitoun, Marc
Separating Without Any Ambiguity
Abstract
We investigate a standard operator on classes of languages: unambiguous polynomial closure. We show that if C is a class of regular languages having some mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the same problem for C. We give a new, self-contained and elementary proof of this result. We also show that unambiguous polynomial closure coincides with alternating left and right deterministic closure. Finally, if additionally C is finite, we show that the separation and covering problems are decidable for UPol(C).
BibTeX - Entry
@InProceedings{place_et_al:LIPIcs:2018:9141,
author = {Thomas Place and Marc Zeitoun},
title = {{Separating Without Any Ambiguity}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {137:1--137:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9141},
URN = {urn:nbn:de:0030-drops-91419},
doi = {10.4230/LIPIcs.ICALP.2018.137},
annote = {Keywords: Regular languages, separation problem, decidable characterizations}
}
|
Keywords: |
|
Regular languages, separation problem, decidable characterizations |
|
Collection: |
|
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.07.2018 |
