English

Shuffling and Unshuffling

Formal Languages and Automata Theory 2011-07-12 v4

Abstract

We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exercises and examples for undergraduate formal language theory classes, we also provide some new results and some open problems.

Keywords

Cite

@article{arxiv.1106.5767,
  title  = {Shuffling and Unshuffling},
  author = {D. Henshall and N. Rampersad and J. Shallit},
  journal= {arXiv preprint arXiv:1106.5767},
  year   = {2011}
}
R2 v1 2026-06-21T18:28:50.506Z