交换语言的状态复杂度研究——向上与向下闭包、交换无周期语言与交换群语言
形式语言与自动机理论
2021-11-29 v1
摘要
我们研究了交换正则语言上向上与向下闭包及内部运算的状态复杂度。随后，我们系统地研究了这些运算以及 shuffle 运算在交换群语言和交换无周期（或无星）语言上的状态复杂度。
引用
@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}
}
备注
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