具有子字和超字的正则语言闭包和内部的状态复杂性
On the state complexity of closures and interiors of regular languages with subwords and superwords
摘要：
正则语言$L$的向下闭包和向上闭包是通过分别收集其元素的所有子字和超字来获得的。通过分别收集在$L$中具有其所有子词和超词的词，双重地获得$L$的向下和向上内部。我们提供了最小的自动机识别这些封闭和内部的大小上下限。我们还考虑了正则语言闭包判定问题的计算复杂性。
英文摘要：
The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all their subwords and superwords in $L$, respectively. We provide lower and upper bounds on the size of the smallest automata recognizing these closures and interiors. We also consider the computational complexity of decision problems for closures of regular languages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
