Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Formal Languages and Automata Theory
2021-08-19 v2
Abstract
We identify a subclass of the regular commutative languages that is closed under the iterated shuffle, or shuffle closure. In particular, it is regularity-preserving on this subclass. This subclass contains the commutative group languages and, for every alphabet , the class given by the ordered variety . Then, we state a simple characterization when the iterated shuffle on finite commutative languages gives a regular language again and state partial results for aperiodic commutative languages. We also show that the aperiodic, or star-free, commutative languages and the commutative group languages are closed under projection.
Cite
@article{arxiv.2103.09587,
title = {Regularity Conditions for Iterated Shuffle on Commutative Regular Languages},
author = {Stefan Hoffmann},
journal= {arXiv preprint arXiv:2103.09587},
year = {2021}
}
Comments
Accepted at CIAA 2021. Incorporated the remarks by the referees