Prateek Karandikar ; Philippe Schnoebelen - The height of piecewise-testable languages and the complexity of the logic of subwords

lmcs:4850 - Logical Methods in Computer Science, April 30, 2019, Volume 15, Issue 2 - https://doi.org/10.23638/LMCS-15(2:6)2019
The height of piecewise-testable languages and the complexity of the logic of subwordsArticle

Authors: Prateek Karandikar ; Philippe Schnoebelen

    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 article 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 $\mathsf{FO}^2(A^*,\sqsubseteq)$, 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.


    Volume: Volume 15, Issue 2
    Published on: April 30, 2019
    Accepted on: October 24, 2018
    Submitted on: September 24, 2018
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory,F.4.1,F.4.3,F.3.1
    Funding:
      Source : OpenAIRE Graph
    • Parametric Analysis of Concurrent Systems; Funder: French National Research Agency (ANR); Code: ANR-14-CE28-0002

    1 Document citing this article

    Consultation statistics

    This page has been seen 1311 times.
    This article's PDF has been downloaded 402 times.