arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.06043cs.FLcs.CCmath.CT
收藏

确定性字符串机的时间复杂度

Time complexity for deterministic string machines

The Hebrew University of Jerusalem(耶路撒冷希伯来大学)

Nur Cataltepe, Vanessa Kosoy

AI总结:

本文通过范畴论中的字符串图形式化自动机的组合语言,研究确定性有限状态变换的运行时间与表达能力,并给出多项式时间保证的充分条件。

摘要:

过去学习由自动机表示的环境的算法,其复杂度与自动机的状态数成比例,而即使对于识别描述长度较小的正则表达式的自动机,状态数也可能呈指数级增长。因此,我们形式化了一种组合语言,该语言可以将自动机构造为某些范畴之间的变换,表示为字符串图,这更好地反映了各种自动机的描述复杂度。我们通过使这些操作在过滤集上丰富的范畴上运行来定义该框架的复杂度约束,并利用这些约束,我们证明了在有限状态空间上确定性操作的一个子集的运行时间和表达性的基本结果。这些字符串图或“字符串机”本身是范畴中的态射,因此字符串机可以在运行时创建其他字符串机,以建模需要超过常量内存的计算。我们证明了这些机器多项式时间保证的充分条件,这有助于开发同时封装运行时复杂度的字符串机复杂度约束。

英文摘要:

Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small description length. We thus formalize a compositional language that can construct automata as transformations between certain types of category, representable as string diagrams, which better reflects the description complexity of various automata. We define complexity constraints on this framework by having them operate on categories enriched over filtered sets, and using these constraints, we prove elementary results on the runtime and expressivity of a subset of these transformations which operate deterministically on finite state spaces. These string diagrams, or "string machines," are themselves morphisms in a category, so it is possible for string machines to create other string machines in runtime to model computations which take more than constant memory. We prove sufficient conditions for polynomial runtime guarantees on these, which can help develop complexity constraints on string machines which also encapsulate runtime complexity.

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

↑