高斯词平面性问题的描述复杂性
On Descriptional Complexity of the Planarity Problem for Gauss Words
摘要：
本文研究了纽结理论问题的几何复杂性，给出了用高斯字表示的有符号和无符号纽结图的平面性问题的上界。由于结的拓扑等价可以涉及任意多个交叉的结图，因此高斯词将被视为无限（无界）字母表上的字符串。为了建立识别结属性的上界，我们研究这些问题的自动机模型在一个无限的字母表的上下文中。
英文摘要：
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can involve knot diagrams with arbitrarily many crossings then Gauss words will be considered as strings over an infinite (unbounded) alphabet. For establishing the upper bounds on recognition of knot properties, we study these problems in a context of automata models over an infinite alphabet.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
