重新压缩:一个简单而强大的文字公式技术
Recompression: a simple and powerful technique for word equations
摘要:
在本文中,我们提出了一个应用程序的一个简单的局部再压缩技术,以前开发的作者在压缩的隶属度问题和压缩模式匹配,字方程。该技术基于变量的局部修改(用aX或Xa替换X)和用“新”字母迭代替换方程中出现的成对字母,这可以被看作是对给定单词方程的解的自下而上的压缩,更具体地说,构建用于单词方程的解的SLP(直线程序)。利用这一技巧,我们给出了一个新的,独立的和自包含的证明,大多数已知的结果字方程。更具体地说,所提出的(非确定性)算法运行在O(n log n)空间和时间多项式在log N,其中N是长度最小的解决方案的字方程的大小。所提出的算法可以很容易地推广到一个发电机的所有解决方案的给定的字方程(不增加空间的使用)。此外,进一步分析的算法产生的长度最小的解决方案的大小的双指数上界。该算法不使用周期指数的指数界。相反,算法的分析产生一个独立的证明的指数界的周期性指数。我们相信,所提出的算法,它的思想和分析是远远简单的,比所有以前应用。此外,由于它,我们可以得到一个统一的和简单的方法,大多数已知的结果字方程。作为一个小的额外的结果,我们表明,对于O(1)变量(在方程中具有任意多个外观),单词方程可以在线性空间中求解,即它们是上下文敏感的。
英文摘要:
In this paper we present an application of a simple technique of local recompression, previously developed by the author in the context of compressed membership problems and compressed pattern matching, to word equations. The technique is based on local modification of variables (replacing X by aX or Xa) and iterative replacement of pairs of letters appearing in the equation by a `fresh' letter, which can be seen as a bottom-up compression of the solution of the given word equation, to be more specific, building an SLP (Straight-Line Programme) for the solution of the word equation. Using this technique we give a new, independent and self-contained proofs of most of the known results for word equations. To be more specific, the presented (nondeterministic) algorithm runs in O(n log n) space and in time polynomial in log N, where N is the size of the length-minimal solution of the word equation. The presented algorithm can be easily generalised to a generator of all solutions of the given word equation (without increasing the space usage). Furthermore, a further analysis of the algorithm yields a doubly exponential upper bound on the size of the length-minimal solution. The presented algorithm does not use exponential bound on the exponent of periodicity. Conversely, the analysis of the algorithm yields an independent proof of the exponential bound on exponent of periodicity. We believe that the presented algorithm, its idea and analysis are far simpler than all previously applied. Furthermore, thanks to it we can obtain a unified and simple approach to most of known results for word equations. As a small additional result we show that for O(1) variables (with arbitrary many appearances in the equation) word equations can be solved in linear space, i.e. they are context-sensitive.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。