Recognizing binary shuffle squares is NP-hard

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01986646
Contributor : Stéphane Vialette <>
Submitted on : Friday, January 18, 2019 - 11:02:58 PM
Last modification on : Friday, April 12, 2019 - 10:18:10 AM

Identifiers

Collections

Citation

Laurent Bulteau, Stéphane Vialette. Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science, Elsevier, In press, ⟨10.1016/j.tcs.2019.01.012⟩. ⟨hal-01986646⟩

Share

Metrics

Record views

94