The non-Archimedean theory of discrete systems (Q1949084): Difference between revisions

For a family of discrete dynamical systems described by finite automata, questions of transitivity on the space of finite words is explored. This is done via an associated family of continuous maps on \(p\)-adic metric spaces, and by relating properties like transitivity to ergodicity of these maps. This leads to checkable conditions to guarantee various degrees of transitivity.