Abstract
In the paper we develop the -adic theory of discrete automata. Every automaton (transducer) whose input/output alphabets consist of symbols can be associated to a continuous (in fact, 1-Lipschitz) map from -adic integers to integers, the automaton function . The -adic theory (in particular, the -adic ergodic theory) turned out to be very efficient in a study of properties of automata expressed via properties of automata functions. In the paper we prove a criterion for finiteness of the number of states of automaton in terms of van der Put series of the automaton function. The criterion displays connections between -adic analysis and the theory of automata sequences.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.