Shuffling and unshuffling

MaRDI QIDQ4584890zbMATH OpenFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited in

(21)

• Shuffle and scattered deletion closure of languages
• Algorithmic and algebraic aspects of unshuffling permutations
• Recognizing binary shuffle squares is \textsf{NP}-hard
• Infinite unfair shuffles and associativity
• Shuffle operations on discrete paths
• Unshuffling a square is NP-hard
• On recognising words that are squares for the shuffle product
• The Shuffle Product: New Research Directions
• scientific article; zbMATH DE number 2186916 (Why is no real title available?)
• Shuffle Expressions and Words with Nested Data
• Square-free words with square-free self-shuffles
• Languages under concatenation and shuffling
• Infinite self-shuffling words
• Initial literal shuffles of uniform codes
• 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
• Decision problems on copying and shuffling
• Shuffle squares and nest-free graphs
• The n-ary initial literal and literal shuffle

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)