Skip to main content
SpringerLink
Log in

An Algorithm for Recognizing the Spherical Transitivity of an Initial Binary Automaton

  • Research Articles
  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

An algorithm is presented which determines in a finite number of steps whether an initial finite binary automaton is spherically transitive. Since the class of deterministic functions coincides with the class of functions satisfying the Lipschitz condition with constant 1 on the ring of \(p\)-adic integers, the algorithm is based on an ergodicity criterion for a deterministic function given by a van der Put series.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Bartholdi, R. I. Grigorchuk, and Z. Šuni\’k, “Branch groups,” in Handb. Algebr. (North-Holland, Amsterdam, 2003), Vol. 3, pp. 989–1112.

  2. R. I. Grigorchuk, V. V. Nekrashevich, and V. I. Sushchanskii, “Automata, dynamical systems, and groups,” Proc. Steklov Inst. Math. 231, 134–214 (2000).

    MathSciNet  MATH  Google Scholar 

  3. A. G. Lunts, “\(p\)-Adic apparatus of the theory of finite automata,” Probl. Kibernet. 14, 17–30 (1965).

    Google Scholar 

  4. V. Anashin, “The non-Archimedean theory of discrete systems,” Math. Comput. Sci. 6 (4), 375–393 (2012).

    Article  MathSciNet  Google Scholar 

  5. V. Anashin, A. Khrennikov, and E. Yurova, “T-functions revisited: new criteria for bijectivity/transitivity,” Des. Codes Cryptogr. 71 (3), 383–407 (2014).

    Article  MathSciNet  Google Scholar 

  6. V. Anashin, “Automata finiteness criterion in terms of van der Put series of automata functions,” p-Adic Numbers Ultrametric Anal. Appl. 4 (2), 151–160 (2012).

    Article  MathSciNet  Google Scholar 

  7. K. Mahler, \(p\)-Adic Numbers and Their Functions (Cambridge Univ. Press, Cambridge, 1981).

    MATH  Google Scholar 

  8. V. Anashin and A. Khrennikov, Applied Algebraic Dynamics (Walter de Gruyter, Berlin, 2009).

    Book  Google Scholar 

  9. V. S. Anashin, A. Yu. Khrennikov, and E. I. Yurova, “Characterization of ergodic \(p\)-adic dynamical systems in terms of the van der Put basis,” Dokl. Math. 83 (3), 306–308 (2011).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, 119991, Moscow, Russia

    T. I. Lipina

Authors
  1. T. I. Lipina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. I. Lipina.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lipina, T.I. An Algorithm for Recognizing the Spherical Transitivity of an Initial Binary Automaton. Math Notes 108, 721–726 (2020). https://doi.org/10.1134/S0001434620110103

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434620110103

Keywords

Search

Navigation