Shuffling and Unshuffling
classification
💻 cs.FL
keywords
someshufflingunshufflingalthoughclassesclosureconsiderexamine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.