Abstract

An algorithm is presented which determines in a finite number of steps whether an initial finite binary automaton is spherically transitive. Since the class of deterministic functions coincides with the class of functions satisfying the Lipschitz condition with constant 1 on the ring of \(p\)-adic integers, the algorithm is based on an ergodicity criterion for a deterministic function given by a van der Put series.

中文翻译：

---

识别初始二进制自动机的球面传递性的算法

摘要

提出了一种算法，该算法以有限的步骤确定初始的有限二进制自动机是否是球形传递的。由于确定性函数的类别与满足Lipschitz条件且在\（p \）- adic整数的环上具有常数1的函数的类别一致，因此该算法基于范德普特给出的确定性函数的遍历性准则系列。