arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.06435cs.FLmath.LO
收藏

单字母表上有限自动机所识别的语言

Languages given by Finite Automata over the Unary Alphabet

Wojciech Czerwiński, Maciej Dębski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michał Skrzypczak, Frank Stephan, Christopher Tan

AI总结:

本文研究单字母表下有限自动机的运算与判定问题复杂度,改进了NFA的包含与等价判定时间上界,给出UFA的并、补运算状态数上界及连接运算的状态数下界,并探讨了相关ω-正则语言判定的难度。

摘要:

本文研究字母表为单字符时,有限自动机上的运算复杂度及其判定问题的复杂度。令$n$表示对应结果中所考虑的输入有限自动机状态数的最大值,本文得到以下主要结果:(1) 给定两个分别识别语言$L$和$H$的单字符NFA(非确定有限自动机),可以在$2^{O((n \log n)^{1/3})}$时间内判定$L \subseteq H$以及$L = H$是否成立。此前的时间上界由Chrobak(1986)给出,为$2^{O((n \log n)^{1/2})}$,且该上界在此后未得到显著改进。(2) 给定两个分别识别$L$和$H$的单字符UFA(无歧义有限自动机),可以构造出识别$L \cup H$的UFA和识别$L$的补集的UFA,这些输出UFA的状态数上界为$n$的拟多项式。但在最坏情况下,识别两个$n$状态UFA所识别语言的连接的UFA需要$2^{\Theta((n \log^2 n)^{1/3})}$个状态。(3) 给定单字符语言$L$,若$L$包含长度为$k$的单词,则令$L(k)=1$,否则令$L(k)=0$。令$\omega_L$为$\omega$-字$L(0)L(1)\ldots$,令$\cal L$为固定的$\omega$-正则语言。最后一节研究了给定$n$状态UFA或NFA时,判定相关问题的难度。

英文摘要:

This paper studies the complexity of operations on finite automata and the complexity of their decision problems when the alphabet is unary. Let $n$ denote the maximum of the number of states of the input finite automata considered in the corresponding results. The following main results are obtained: (1) Given two unary NFAs recognising $L$ and $H$, respectively, one can decide whether $L \subseteq H$ as well as whether $L = H$ in time $2^{O((n \log n)^{1/3})}$. The previous upper bound on time was $2^{O((n \log n)^{1/2})}$ as given by Chrobak (1986), and this bound was not significantly improved since then. (2) Given two unary UFAs (unambiguous finite automata) recognising $L$ and $H$, respectively, one can determine a UFA recognising $L \cup H$ and a UFA recognising complement of $L$, where these output UFAs have the number of states bounded by a quasipolynomial in $n$. However, in the worst case, a UFA for recognising concatenation of languages recognised by two $n$-state UFAs, uses $2^{Θ((n \log^2 n)^{1/3})}$ states. (3) Given a unary language $L$, if $L$ contains the word of length $k$, then let $L(k)=1$ else let $L(k)=0$. Let $ω_L$ be the $ω$-word $L(0)L(1)\ldots$ and let $\cal L$ be a fixed $ω$-regular language. The last section studies how difficult it is to decide, given an $n$-state UFA or NFA

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑