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

有限串的概率自动复杂度

Probabilistic automatic complexity of finite strings

Kenneth Gill

AI总结:

本文提出基于概率有限状态自动机(PFAs)的有限串新复杂度度量$A_P(x)$及其变体$A_{P,δ}(x)$,证明了其可计算性,关联了DFA与NFA复杂度,并完成了$A_P=2$二元串的完整分类。

摘要:

我们使用概率有限状态自动机(PFAs)为有限串引入了一种新的复杂度度量,其精神与采用DFAs和NFAs的现有概念相同,并探索了其性质。PFA复杂度$A_P(x)$是PFA的最少状态数,使得$x$是其长度下最可能被接受的字符串。变体$A_{P,δ}(x)$增加了一个实值参数$δ$,指定$x$与其他字符串在接受概率上差距的所需下界。我们证明了$A_{P,δ}$对所有$δ$都是$δ$可计算的,将$A_P$与DFA和NFA复杂度联系起来,并获得了$A_P=2$的二元串的完整分类。最后,我们讨论了$A_P$的其他几种变体,以期获得额外的理想性质。

英文摘要:

We introduce a new complexity measure for finite strings using probabilistic finite-state automata (PFAs), in the same spirit as existing notions employing DFAs and NFAs, and explore its properties. The PFA complexity $A_P(x)$ is the least number of states of a PFA for which $x$ is the most likely string of its length to be accepted. The variant $A_{P,δ}(x)$ adds a real-valued parameter $δ$ specifying a required lower bound on the gap in acceptance probabilities between $x$ and other strings. We prove $A_{P,δ}$ is $δ$-computable for all $δ$, relate $A_P$ to the DFA and NFA complexities, and obtain a complete classification of binary strings with $A_P=2$. Finally, we discuss several other variations on $A_P$ with a view to obtaining additional desirable properties.

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

↑