Compressed Subsequence Checking is PSPACE-complete
Markus Lohrey
Abstract
It is shown that the (scattered) subsequence problem for two words represented by straight-line programs is PSPACE-complete, even over a binary alphabet. The lower bound is obtained by a polynomial-time reduction from quantified subset sum.
Create a lesson
Related papers
Context-Free Fixed Points and Complete Classification of Orbits in Picard Iteration for Guarded Power Language Operators
Atanas Ilchev, Hristo Kiskinov, George Pashev et al.
Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor
Ziran Wang, Jie An, Naijun Zhan
Non-Terminal Complexity of Simple Semi-Conditional Grammars
Henning Fernau, Sanjay Jain, Linus Richter et al.
On the Kanazawa--Salvati Conjecture
Takao Yuyama
Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound
Kehinde Adeogun, Christos A. Kapoutsis
Stochastic Hybrid Automata for Power Profile Modeling in Energy Systems
Lisa Willemsen, Anne Remke, Johann L. Hurink