compressed_subsequence_testing (303B)
1 # Compressed subsequence testing 2 3 The [computational_problem], given two [compressed_words] u and v, of [deciding] if u is a [subsequence] of v 4 5 If u and v are given as [SLPs], it is [PSPACE_complete], even on a [binary_alphabet], cf [lohrey2026compressed] 6 7 Up: [subsequence_testing], [compressed_word]