Publication:4584890
From MaRDI portal
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
68Q45: Formal languages and automata
Related Items
On Shuffling a Word with its Letter-to-Letter Substitution, Long twins in random words, Abelian combinatorics on words: a survey, Shuffle squares and reverse shuffle squares, Square-free words with square-free self-shuffles, Infinite self-shuffling words, Algorithmic and algebraic aspects of unshuffling permutations, Recognizing binary shuffle squares is \textsf{NP}-hard, Unshuffling a square is NP-hard, On recognising words that are squares for the shuffle product, The Shuffle Product: New Research Directions