Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-06-28
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
Henshall Dane
Rampersad Narad
Shallit Jeffery
No associations
LandOfFree
Shuffling and Unshuffling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Shuffling and Unshuffling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shuffling and Unshuffling will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-42035