Skip to main content
SpringerLink
Log in

Nonlinear automata over a finite ring

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The properties of the class of information-lossless automata represented by recurrent relations over a finite ring are investigated. For these automata, the structure of classes of equivalent states is investigated, problems of parametric identification and identification of the initial state are solved, and the variation in the behavior of such automata as a result of variation of their parameters or initial states is 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. Gill, Introduction to the Theory of Finite-State Machines [Russian translation], Nauka, Moscow (1966).

    MATH  Google Scholar 

  2. A. P. Goryashko, “Design of easily tested discrete devices: Ideas, methods, and realization,” Avtomat. Telemekh., No. 7, 5–35 (1984).

  3. R. Kalman, P. Falb, and M. Arbib, Topics in Mathematical Systems Theory [Russian translation], Mir, Moscow (1971).

    Google Scholar 

  4. T. N. Hibbard, “Least upper bounds on minimal terminal state experiments for two classes of sequential machines,” J. Assoc. Comput. Math., No. 8, 601–612 (1961).

  5. P. Starke, “Uber experimente an automaten,” Zetschr. f. Math. Logic und Grundl. d. Math., 13, 67–80 (1967).

    MATH  MathSciNet  Google Scholar 

  6. I. K. Rystsov, “Estimation of the length of the shortest diagnostic word for a finite automaton,” Kibernetika, No. 6, 40–45 (1978).

  7. I. K. Rystsov, “Asymptotic estimation of the length of the shortest diagnostic word for a finite automaton,” Dokl. Akad. Nauk SSSR, 241, No. 2, 294–296 (1978).

    MathSciNet  Google Scholar 

  8. M. N. Sokolovskii, “Bounds on the length of the diagnostic word of a finite automaton,” Kibernetika, No. 2, 16–21 (1976).

  9. V. G. Skobelev, “On Estimation of Lengths of Distinguishing and Synchronizing Sequences for automata,” Kibernetika, No. 4, 114–116 (1987).

  10. A. Gill, Linear Sequential Circuits [Russian translation], Nauka, Moscow (1974).

    MATH  Google Scholar 

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

    Google Scholar 

  12. B. A. Trahtenbrot and J. M. Barzdin, Finite Automata: Behavior and Synthesis [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  13. R. Blahut, Theory and Practice of Error Control Codes [Russian translation], Mir, Moscow (1986).

    MATH  Google Scholar 

  14. Yu. S. Kharin, Mathematical and Computer Foundations of Cryptology [in Russian], Novoye Znaniye, Minsk (2003).

    Google Scholar 

  15. S. P. Kuznetsov, Dynamical Chaos [in Russian], Fizmatgiz, Moscow (2001).

    Google Scholar 

  16. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  17. A. A. Kurmit, Information-Lossless Automata of Finite Order [in Russian], Zinatne, Riga (1972).

    Google Scholar 

  18. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).

    MATH  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

Additional information

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 29–42, November–December 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skobelev, V.G. Nonlinear automata over a finite ring. Cybern Syst Anal 42, 795–806 (2006). https://doi.org/10.1007/s10559-006-0120-5

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-006-0120-5

Keywords

Search

Navigation