arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1812.06347cs.FL
收藏

置换的最优正则表达式

Optimal Regular Expressions for Permutations

Antonio Molina Lovett, Jeffrey Shallit

摘要:

置换语言$P_n$由大小为$n$的固定字母表的置换的所有字组成。使用分治法,我们构造了一个指定$P_n$的正则表达式$R_n$。然后,我们给出明确的界限$R_n$的长度,我们发现是$4^n n^{-(\lg n)/4+Θ(1)}$,并使用这些界限表明,$R_n$具有最小的大小超过所有正则表达式指定$P_n$。

英文摘要:

The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length of $R_n$, which we find to be $4^n n^{-(\lg n)/4+Θ(1)}$, and use these bounds to show that $R_n$ has minimum size over all regular expressions specifying $P_n$.

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

↑