Abstract
In the paper, we study behaviour of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behaviour of the system w.r.t. variety of word transformations performed by the system: we call a system completely transitive if, given arbitrary pair a, b of finite words that have equal lengths, the system \({\mathfrak{A}}\) , while evolution during (discrete) time, at a certain moment transforms a into b. To every system \({\mathfrak{A}}\) , we put into a correspondence a family \({\mathcal{F}_{\mathfrak{A}}}\) of continuous mappings of a suitable non-Archimedean metric space and show that the system is completely transitive if and only if the family \({\mathcal{F}_{\mathfrak{A}}}\) is ergodic w.r.t. the Haar measure; then we find easy-to-verify conditions the system must satisfy to be completely transitive. The theory can be applied to analyse behaviour of straight-line computer programs (in particular, pseudo-random number generators that are used in cryptography and simulations) since basic CPU instructions (both numerical and logical) can be considered as continuous mappings of a (non-Archimedean) metric space \({\mathbb{Z}_{2}}\) of 2-adic integers.
Similar content being viewed by others
References
Aliprantis C.D., Burkinshaw O.: Principles of Real Analysis, 3rd edn. Academic Press, Inc., Boston (1998)
Allouche J.P., Shallit J.: Automatic Sequences. Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)
Anashin, V.: Non-Archimedean theory of T-functions. In: Proceedings of the Advanced Study Institute Boolean Functions in Cryptology and Information Security. In: NATO Sci. Peace Secur. Ser. D Inf. Commun. Secur., vol. 18, pp. 33–57. IOS Press, Amsterdam (2008)
Anashin V.: Non-Archimedean ergodic theory and pseudorandom generators. Comput. J. 53(4), 370–392 (2010)
Anashin, V., Khrennikov, A.: Applied algebraic dynamics. In: de Gruyter Expositions in Mathematics, vol. 49. Walter de Gruyter GmbH & Co., Berlin (2009)
Anashin V.S.: Uniformly distributed sequences of p-adic integers. Math. Notes 55(2), 109–133 (1994)
Anashin V.S.: Uniformly distributed sequences in computer algebra, or how to construct program generators of random numbers. J. Math. Sci. 89(4), 1355–1390 (1998)
Anashin V.S.: Uniformly distributed sequences of p-adic integers, II. Discrete Math. Appl. 12(6), 527–590 (2002)
Brauer W.: Automatentheorie. B. G. Teubner, Stuttgart (1984)
Gouvêa F.Q.: p-adic Numbers, An Introduction, 2nd edn. Springer, Berlin (1997)
Grigorchuk R.I.: Some topics in the dynamics of group actions on rooted trees. Proc. Steklov Inst. Math. 273, 64–175 (2011)
Grigorchuk I., Nekrashevich V.V., Sushchanskii V.I.: Automata, dynamical systems, and groups. Proc. Steklov Inst. Math. 231, 128–203 (2000)
Kalman R.E., Falb P.L., Arbib M.A.: Topics in Mathematical System Theory. McGraw-Hill, New York (1969)
Katok S.: p-adic analysis in comparison with real. In: Mass Selecta. American Mathematical Society, Providence (2003)
Knuth D.: The art of computer programming. In: Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley, Boston (1997)
Koblitz N.: p-adic numbers, p-adic analysis, and zeta-functions. In: Graduate Texts in Mathematics, vol. 58, 2nd edn. Springer, Berlin (1984)
Lunts, A.G.: The p-adic apparatus in the theory of finite automata. Problemy Kibernetiki. 14, 17–30 (1965, In Russian)
Pin, J.E.: Profinite methods in automata theory. In: Symposium on Theoretical Aspects of Computer Science—STACS 2009, Freiburg, pp. 31–50 (2009)
Roth, C.H., Jr.: Fundamentals of logic design, 5th edn. Thomson-Brooks-Cole, Belmont (2004)
Schikhof W.H.: Ultrametric Calculus. Cambridge University Press, Cambridge (1984)
Vuillemin J.: On circuits and numbers. IEEE Trans. Comput. 43(8), 868–879 (1994)
Vuillemin J.: Finite digital synchronous circuits are characterized by 2-algebraic truth tables. In: Advances in Computing Science—ASIAN 2000. Lecture Notes in Computer Science, vol. 1961, pp 1–7 (2000)
Vuillemin J.: Digital algebra and circuits. In: Verification: Theory and Practice. Lecture Notes in Computer Science, vol. 2772, pp. 733–746 (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in parts by Russian Foundation for Basic Research Grant No. 12-01-00680-a and by Chinese Academy of Sciences visiting professorship for senior international scientists Grant No. 2009G2-11.
Rights and permissions
About this article
Cite this article
Anashin, V. The Non-Archimedean Theory of Discrete Systems. Math.Comput.Sci. 6, 375–393 (2012). https://doi.org/10.1007/s11786-012-0132-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-012-0132-7