状态独立性与正规序列
Finite-state Independence and Normal Sequences
摘要：
我们认为，以前定义的有限状态独立的概念，我们专注于正常的话。我们用三种不同的方法，使用三种不同的异步确定性有限自动机与两个输入磁带包含无限的话，正常的话的有限状态的独立性。基于其中一个刻画，我们给出了一个构造有限状态独立正规词对的算法。
英文摘要：
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous deterministic finite automata with two input tapes containing infinite words. Based on one of the characterizations we give an algorithm to construct a pair of finite-state independent normal words.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
