scientific article; zbMATH DE number 6931778
From MaRDI portal
Publication:4584890
zbMath1394.68212MaRDI QIDQ4584890
Narad Rampersad, Dane Henshall, Jeffrey O. Shallit
Publication date: 4 September 2018
Full work available at URL: http://eatcs.org/beatcs/index.php/beatcs/article/view/71/67
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Unshuffling a square is NP-hard ⋮ Long twins in random words ⋮ Square-free words with square-free self-shuffles ⋮ Abelian combinatorics on words: a survey ⋮ Shuffle squares and reverse shuffle squares ⋮ On recognising words that are squares for the shuffle product ⋮ Infinite self-shuffling words ⋮ Algorithmic and algebraic aspects of unshuffling permutations ⋮ Recognizing binary shuffle squares is \textsf{NP}-hard ⋮ The Shuffle Product: New Research Directions ⋮ On Shuffling a Word with its Letter-to-Letter Substitution
This page was built for publication:
