Inproceedings3005: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Tomas Masopust (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorNachname=Czerwiński |ErsterAutorVorname=Wojciech }} {{Publikation Author |Rank=2 |Author=Wim Martens }} {{Publikation A…“) |
Markus Krötzsch (Diskussion | Beiträge) K (Textersetzung - „|Forschungsgruppe=Knowledge Systems“ durch „|Forschungsgruppe=Wissensbasierte Systeme“) |
||
| (4 dazwischenliegende Versionen von 2 Benutzern werden nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname=Wojciech | |||
|ErsterAutorNachname=Czerwiński | |ErsterAutorNachname=Czerwiński | ||
| | |FurtherAuthors=Wim Martens; Tomáš Masopust | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 19: | Zeile 12: | ||
|Pages=150-161 | |Pages=150-161 | ||
|Publisher=Springer | |Publisher=Springer | ||
|Editor=F. V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg | |||
|Series=LNCS | |Series=LNCS | ||
|Volume=7966 | |Volume=7966 | ||
| Zeile 25: | Zeile 19: | ||
|Abstract=When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata. | |Abstract=When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata. | ||
|ISBN=978-3-642-39211-5 | |ISBN=978-3-642-39211-5 | ||
|Download=Efficient Separability of Regular Languages by Subsequences and Suffixes.pdf | |||
|DOI Name=10.1007/978-3-642-39212-2_16 | |DOI Name=10.1007/978-3-642-39212-2_16 | ||
|Forschungsgruppe= | |Forschungsgruppe=Wissensbasierte Systeme | ||
}} | }} | ||
Aktuelle Version vom 24. Mai 2016, 18:01 Uhr
Efficient Separability of Regular Languages by Subsequences and Suffixes
Wojciech CzerwińskiWojciech Czerwiński, Wim MartensWim Martens, Tomáš MasopustTomáš Masopust
Wojciech Czerwiński, Wim Martens, Tomáš Masopust
Efficient Separability of Regular Languages by Subsequences and Suffixes
In F. V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg, eds., Proc. of 40th International Colloquium on Automata, Languages, and Programming (ICALP), volume 7966 of LNCS, 150-161, 2013. Springer
Efficient Separability of Regular Languages by Subsequences and Suffixes
In F. V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg, eds., Proc. of 40th International Colloquium on Automata, Languages, and Programming (ICALP), volume 7966 of LNCS, 150-161, 2013. Springer
- KurzfassungAbstract
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata. - Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{CMM2013,
author = {Wojciech Czerwi{\'{n}}ski and Wim Martens and Tom{\'{a}}{\v{s}}
Masopust},
title = {Efficient Separability of Regular Languages by Subsequences and
Suffixes},
editor = {F. V. Fomin and R. Freivalds and M. Kwiatkowska and D. Peleg},
booktitle = {Proc. of 40th International Colloquium on Automata, Languages,
and Programming (ICALP)},
series = {LNCS},
volume = {7966},
publisher = {Springer},
year = {2013},
pages = {150-161},
doi = {10.1007/978-3-642-39212-2_16}
}
