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

有限状态独立正常对的高效构造

Efficient Constructions of Finite-State Independent Normal Pairs

National Research University Higher School of Economics(国立高等经济大学)

Subin Pulari

AI总结:

本文提出高效构造有限状态独立正常对的方法,通过确定性多项式时间算法和显式构造解决正常序列的有限状态独立问题。

摘要:

有限状态独立性是针对无限序列的稳健算法独立概念。Becher、Carton和Heiber通过确定性异步双带有限自动机为一般无限序列引入了这一概念。Álvarez、Becher和Carton随后研究了正常情况,并用确定性有限状态混排机来表征有限状态独立性。混排机是一种读取两个输入带$x,y∈Σ^∞$的有限自动机,在每一步选择一个带读取下一个,输出读取的符号,并根据仅该输出符号更新状态。在这一表征下,两个正常源是有限状态独立的,如果每一个确定性有限状态混排(交错)它们仍产生一个正常序列。Álvarez、Becher和Carton提出了以下问题:(1)能否高效计算有限状态独立的正常对,改进其双指数方法;(2)给定一个正常序列$x$,能否有效构造一个正常序列$y$,使其与$x$有限状态独立?我们通过显式的确定性构造回答了这两个问题。首先,我们给出一个确定性多项式时间算法,输入$N$,输出两个正常序列$x$和$y$的前$N$个符号,使得对于每一个混排机$S$,混排输出$S(x,y)$是正常的;因此$(x,y)$是有限状态独立的。第二,我们有效解决了单侧伴生问题。给定任何可计算的正常序列$x∈Σ^∞$,我们给出一个显式的确定性构造,生成一个可计算的正常序列$y∈Σ^∞$,使得对于每一个混排机$S$,混排输出$S(x,y)$是正常的。特别是,$x$和$y$通过混排表征定理是有限状态独立的。

英文摘要:

Finite-state independence is a robust notion of algorithmic independence for infinite words. It was introduced for general infinite words by Becher, Carton, and Heiber via deterministic asynchronous two-tape finite automata. Álvarez, Becher, and Carton then studied the normal case and characterized finite-state independence in terms of deterministic finite-state shufflers. A shuffler is a finite automaton that reads from two input tapes $x,y\inΣ^\infty$ and, at each step, chooses one tape to read next, outputs the symbol read, and updates its state based only on that output symbol. In terms of this characterization, two normal sources are finite-state independent if every deterministic finite-state way of shuffling (interleaving) them still produces a normal sequence. Álvarez, Becher, and Carton posed the following questions: (1) can one compute finite-state independent normal pairs efficiently, improving their doubly-exponential procedure; and (2) given a normal word $x$, can one effectively construct a normal word $y$ that is finite-state independent from $x$? We answer both questions by explicit deterministic constructions. First, we give a deterministic polynomial-time algorithm that, on input $N$, outputs the first $N$ symbols of two normal words $x$ and $y$ such that for every shuffler $S$, the shuffled output $S(x,y)$ is normal; hence $(x,y)$ is finite-state independent. Second, we solve the one-sided companion problem effectively. Given any computable normal word $x\inΣ^\infty$, we give an explicit deterministic construction of a computable normal word $y\inΣ^\infty$ such that for every shuffler $S$, the shuffled output $S(x,y)$ is normal. In particular, $x$ and $y$ are finite-state independent by the shuffler characterization theorem.

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

↑