Recognizing binary shuffle squares is NP-hard - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2020

Recognizing binary shuffle squares is NP-hard

Résumé

A shuffle of two words is formed by interleaving the characters into a new word, keeping the characters of each word in order. A word is a shuffle square if it is a shuffle of two identical words. Deciding whether a word is a shuffle square has been proved to be NP-complete independently by Buss and Soltys [5] and Rizzi and Vialette [20], the former proving the result for alphabets as small as 9 letters. We prove in this paper that deciding whether a binary word is a shuffle square is NP-complete.

Dates et versions

hal-01986646 , version 1 (18-01-2019)

Identifiants

Citer

Laurent Bulteau, Stéphane Vialette. Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science, 2020, 806, pp.116-132. ⟨10.1016/j.tcs.2019.01.012⟩. ⟨hal-01986646⟩
195 Consultations
0 Téléchargements

Partager

More