Abstract
In the paper we develop the p-adic theory of discrete automata. Every automaton \(\mathfrak{A}\) (transducer) whose input/output alphabets consist of p symbols can be associated to a continuous (in fact, 1-Lipschitz) map from p-adic integers to p-adic integers, the automaton function \(f_\mathfrak{A} \). The p-adic theory (in particular, the p-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 p-adic analysis and the theory of automata sequences.
Similar content being viewed by others
References
J.-P. Allouche and J. Shallit, Automatic Sequences. Theory, Applications, Generalizations (Cambridge Univ. Press, 2003).
V. Anashin and A. Khrennikov, Applied Algebraic Dynamics, de Gruyter Expositions in Mathematics 49 (Walter de Gruyter GmbH & Co., Berlin, N.Y., 2009).
V. S. Anashin, A. Yu. Khrennikov and E. I. Yurova, “Characterization of ergodicity of p-adic dynamical systems by using van der Put basis,” DokladyMath. 83(3), 306–308 (2011).
W. Brauer, Automatentheorie (B. G. Teubner, Stuttgart, 1984).
R. I. Grigorchuk, “Some topics in the dynamics of group actions on rooted trees,” Proc. Steklov Inst. Math. 273, 64–175 (2011).
R. I. Grigorchuk, V. V. Nekrashevich and V. I. Sushchanskii, “Automata, dynamical systems, and groups,” Proc. Steklov Inst. Math. 231, 128–203 (2000).
K. Hensel, “Über eine neue Begr ündung der Theorie der algebraischen Zahlen,” Jahresbericht der Deutschen Mathematiker-Vereinigung 6(3), 83–88 (1897).
A. G. Lunts, “The p-adic apparatus in the theory of finite automata,” Problemy Kibernetiki 14, 17–30 (1965) [in Russian].
K. Mahler, p-Adic Numbers and Their Functions (Cambridge Univ. Press, 1981).
J.-E. Pin, “Profinite methods in automata theory,” in Symposium on Theoretical Aspects of Computer Science — STACS 2009, pp. 31–50 (Freiburg, 2009).
W. H. Schikhof, Ultrametric Calculus (Cambridge Univ. Press, 1984).
V. S. Vladimirov and I. V. Volovich, “Superanalysis 1. Differential calculus,” Theor. Math. Phys. 59, 317–335 (1984).
V. S. Vladimirov and I. V. Volovich, “Superanalysis 2. Integral calculus,” Theor. Math. Phys. 60, 743–765 (1985).
V. S. Vladimirov, I. V. Volovich and E. I. Zelenov, p-Adic Analysis and Mathematical Physics (Scientific, Singapore, 1994).
I. V. Volovich, “p-Adic string,” Class. Quant. Grav. 4, 83–87 (1987).
J. Vuillemin, “On circuits and numbers,” IEEE Trans. Comp. 43(8), 868–879 (1994).
J. Vuillemin, “Finite digital synchronous circuits are characterized by 2-algebraic truth tables,” in Advances in Computing Science — ASIAN 2000, Lect. Notes Comp. Sci. 1961, 1–7 (2000).
J. Vuillemin, “Digital algebra and circuits,” in Verification: Theory and Practice, Lect. Notes Comp. Sci. 2772, 733–746 (2003).
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Professor Igor Volovich on the occasion of his 65-th birthday
The text was submitted by the author in English.
Rights and permissions
About this article
Cite this article
Anashin, V. Automata finiteness criterion in terms of van der Put series of automata functions. P-Adic Num Ultrametr Anal Appl 4, 151–160 (2012). https://doi.org/10.1134/S2070046612020070
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S2070046612020070