Skip to main content
SpringerLink
Log in

On the complexity of analysis of automata over a finite ring

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A general scheme is investigated that is destined for obtaining estimates based on the cardinality of subsets of a fixed set of automata over some finite commutative-associative ring with unit element. A scheme is proposed to solve parametric systems of polynomial equations based on classes of associated elements of the ring. Some general characteristics of automata over the ring are established.

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. S. P. Kuznetsov, Dynamic Chaos [in Russian], Fizmatgiz, Moscow (2001).

    Google Scholar 

  2. P. Yu. Kostenko, A. V. Antonov, and T. P. Kostenko, “Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks,” Cybernetics and Systems Analysis, No. 5, 694–701 (2006).

  3. P. Yu. Kostenko, A. V. Antonov, and T. P. Kostenko, “Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics,” Cybernetics and Systems Analysis, No. 6, 884–891 (2006).

  4. A. Gill, Linear Sequential Machines [Russian translation], Nauka, Moscow (1974).

    Google Scholar 

  5. R. G. Faradzhev, Linear Sequential Machines [in Russian], Sov. Radio, Moscow (1975).

    Google Scholar 

  6. G. P. Agibalov, “Recognition of operators realizable in linear autonomous automata,” Izv. AN SSSR, Tekhn. Kibernetika, No. 3, 99–108 (1970).

  7. G. P. Agibalov and Ya. G. Yufit, “On simple experiments for linear initial automata,” Avtomat. Vychisl. Tekhnika, No. 2, 17–19 (1972).

  8. D. V. Speranskii, Experiments with Linear and Bilinear Finite Automata [in Russian], SGU, Saratov (2004).

    Google Scholar 

  9. A. G. Kurosh, Lectures on General Algebra [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  10. A. S. Kuz’min, V. L. Kurakin, and A. A. Nechaev, “Pseudo-random and polylinear sequences,” in: Tr. Diskr. Mat., 1, TVP, Moscow (1997), pp. 139–202.

  11. A. S. Kuz’min, V. L. Kurakin, and A. A. Nechaev, “Properties of linear and polylinear recurrences over Galois rings (I),” in: Tr. Diskr. Mat., 2, TVP, Moscow (1998), pp. 191–222.

  12. V. V. Skobelev, “Analyzing the structure of a class of linear automata over a ring \( {\mathcal{Z}_{{p^k}}} \),” Cybernetics and Systems Analysis, No. 3, 362–374 (2008).

  13. V. V. Skobelev, “Characteristics of linear one-dimensional automata with a lag l over a finite ring,” in: Trans. IPMM NAN Ukrainy, 16, 190–196 (2008).

    Google Scholar 

  14. V. G. Skobelev, “Nonlinear automata over a finite ring,” Cybernetics and Systems Analysis, No. 6, 795–806 (2006).

  15. V. V. Skobelev, “Two types of nonlinear automata over a finite ring,” Cybernetics and Systems Analysis, No. 4, 551–561 (2009).

  16. V. V. Skobelev, “An exact formula for the number of invertible matrices over a finite ring,” in: Tr. IPMM NAN Ukrainy, 18, 155–158 (2009).

    Google Scholar 

  17. V. V. Skobelev and V. G. Skobelev, Analysis of Cryptosystems [in Russian], IPMM NAN Ukrainy, Donetsk (2009).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk, Ukraine

    V. V. Skobelev & V. G. Skobelev

Authors
  1. V. V. Skobelev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. G. Skobelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. V. Skobelev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 17–30, July–August 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skobelev, V.V., Skobelev, V.G. On the complexity of analysis of automata over a finite ring. Cybern Syst Anal 46, 533–545 (2010). https://doi.org/10.1007/s10559-010-9230-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9230-1

Keywords

Search

Navigation