Skip to main content
SpringerLink
Log in

Some subsets of automata over a finite ring

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Sets of Mealy and Moore automata over an arbitrary finite commutative-associative ring are investigated in which transition and output functions are linear combinations of functions of automaton states and functions of inputs. Subsets of strongly connected, reduced, and reversible automata and automata with permutation transition functions are characterized.

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. A. P. Alferov, A. Yu. Zubov, A. S. Kuz’min, et al., Foundations of Cryptography [in Russian], Gelios ARV, Moscow (2002).

    Google Scholar 

  2. Yu. S. Kharin, V. I. Bernik, G. V. Matveev, et al., Mathematical and Computer Foundations of Cryptology [in Russian], Novoye Znanie, Minsk (2003).

    Google Scholar 

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

    Google Scholar 

  4. A. S. Kuz’min, V. L. Kurakin, and A. A. Nechaev, “Properties of linear and polylinear recurrent sequences over Galois rings. I,” in: Tr. Diskretn. Mat., Vol. 2, Nauchn. Izd-vo “TVP,” Moscow (1998), pp. 191–222.

    Google Scholar 

  5. V. V. Skobelev and V. G. Skobelev, Analysis of Cipher Systems [in Russian], IAMM of NAS of Ukraine, Donetsk (2009).

    Google Scholar 

  6. V. V. Skobelev and V. G. Skobelev, “On the complexity of analysis of automata over a finite ring,” Cybernetics and Systems Analysis, Vol. 46, No. 4, 533–545 (2010).

    Article  Google Scholar 

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

    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. G. Skobelev

Authors
  1. V. G. Skobelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. G. Skobelev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 27–30, March–April 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skobelev, V.G. Some subsets of automata over a finite ring. Cybern Syst Anal 47, 198–201 (2011). https://doi.org/10.1007/s10559-011-9302-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-011-9302-x

Keywords

Search

Navigation