DeepAI AI Chat
Log In Sign Up

On the Separability Problem of String Constraints

by   Parosh Aziz Abdulla, et al.

We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, does there exist a language I in S separating A and B (i.e., I is a superset of A and disjoint from B)? The separability of string constraints is the same as the fundamental problem of interpolation for string constraints. We first show that regular separability of straight line string constraints is undecidable. Our second result is the decidability of the separability problem for straight-line string constraints by piece-wise testable languages, though the precise complexity is open. In our third result, we consider the positive fragment of piece-wise testable languages as a separator, and obtain an EXPSPACE algorithm for the separability of a useful class of straight-line string constraints, and a PSPACE-hardness result.


page 1

page 2

page 3

page 4


Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems

We consider subsequences with gap constraints, i.e., length-k subsequenc...

On formally undecidable propositions in nondeterministic languages

Any class of languages 𝐋 accepted in time 𝐓 has a counterpart 𝐍𝐋 accepte...

What Is Decidable about String Constraints with the ReplaceAll Function

Recently, it was shown that any theory of strings containing the string-...

On Problems Dual to Unification: The String-Rewriting Case

In this paper, we investigate problems which are dual to the unification...

Parameterized String Equations

We study systems of String Equations where block variables need to be as...

Parallel Hyperedge Replacement Grammars

In 2018, it was shown that all finitely generated virtually Abelian grou...

From n-grams to trees in Lindenmayer systems

In this paper we present two approaches to Lindenmayer systems: the rule...