Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.37
URN: urn:nbn:de:0030-drops-65776
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6577/
Karandikar, Prateek ; Schnoebelen, Philippe
The Height of Piecewise-Testable Languages with Applications in Logical Complexity
| pdf-format: |
|
Abstract
The height of a piecewise-testable language L is the maximum length of the words needed to define L by excluding and requiring given subwords. The height of L is an important descriptive complexity measure that has not yet been investigated in a systematic way. This paper develops a series of new techniques for bounding the height of finite languages and of languages obtained by taking closures by subwords, superwords and related operations.As an application of these results, we show that FO^2(A^*, subword), the two-variable fragment of the first-order logic of sequences with the subword ordering, can only express piecewise-testable properties and has elementary complexity.
BibTeX - Entry
@InProceedings{karandikar_et_al:LIPIcs:2016:6577,
author = {Prateek Karandikar and Philippe Schnoebelen},
title = {{The Height of Piecewise-Testable Languages with Applications in Logical Complexity}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {37:1--37:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Jean-Marc Talbot and Laurent Regnier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6577},
URN = {urn:nbn:de:0030-drops-65776},
doi = {10.4230/LIPIcs.CSL.2016.37},
annote = {Keywords: Descriptive complexity}
}
| Keywords: | Descriptive complexity | |
| Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 29.08.2016 |
