Automata finiteness criterion in terms of van der Put series of automata functions

preprint2011arXivOpen access

Abstract

In the paper we develop the pp-adic theory of discrete automata. Every automaton A\mathfrak A (transducer) whose input/output alphabets consist of pp symbols can be associated to a continuous (in fact, 1-Lipschitz) map from pp-adic integers to pp integers, the automaton function fAf_\mathfrak A. The pp-adic theory (in particular, the pp-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 pp-adic analysis and the theory of automata sequences.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.