State Complexity Investigations on Commutative Languages -- The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages
Formal Languages and Automata Theory
2021-11-29 v1
Abstract
We investigate the state complexity of the upward and downward closure and interior operations on commutative regular languages. Then, we systematically study the state complexity of these operations and of the shuffle operation on commutative group languages and commutative aperiodic (or star-free) languages.
Keywords
Cite
@article{arxiv.2111.13524,
title = {State Complexity Investigations on Commutative Languages -- The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages},
author = {Stefan Hoffmann},
journal= {arXiv preprint arXiv:2111.13524},
year = {2021}
}
Comments
Accepted at the 23rd International Conference on Descriptional Complexity of Formal Systems (DCFS) 2021, see http://toc.yonsei.ac.kr/dcfs2021/. arXiv admin note: text overlap with arXiv:2008.05420