Shuffling and unshuffling

zbMATH Open1394.68212MaRDI QIDQ4584890FDOQ4584890

Authors: Dane Henshall, Narad Rampersad, Jeffrey Shallit 

Publication date: 4 September 2018

Full work available at URL: http://eatcs.org/beatcs/index.php/beatcs/article/view/71/67

Recommendations

• Languages under concatenation and shuffling
• scientific article; zbMATH DE number 897900
• scientific article; zbMATH DE number 992018
• On the shuffle of star-free languages
• The expressive power of the shuffle product

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (17)

• On recognising words that are squares for the shuffle product
• Initial literal shuffles of uniform codes
• Title not available (Why is that?)
• Algorithmic and algebraic aspects of unshuffling permutations
• Square-free words with square-free self-shuffles
• Long twins in random words
• Infinite self-shuffling words
• Infinite unfair shuffles and associativity
• Decision problems on copying and shuffling
• Recognizing binary shuffle squares is \textsf{NP}-hard
• Shuffle squares and reverse shuffle squares
• Unshuffling a square is NP-hard
• Shuffle operations on discrete paths
• On shuffling a word with its letter-to-letter substitution
• Shuffle Expressions and Words with Nested Data
• The Shuffle Product: New Research Directions
• Abelian combinatorics on words: a survey

This page was built for publication: Shuffling and unshuffling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584890)