Prakash Saivasan

On the Satisfiability of Context-free String Constraints with Subword-Ordering

2022

We consider a variant of string constraints given by membership constraints in context-free languages and subword relation between variables. The satisfiability problem for this variant turns out to be undecidable. We consider a fragment in …