Skip to main content
SpringerLink
Log in

Resetting words for decidable automata

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. J. Cerny, “Poznamka k homogennym experimentom s konecnymy automatami,” Math. Fyz. Cas., SAV,14, 208–215 (1964).

    MATH  MathSciNet  Google Scholar 

  2. V. M. Glushkov, “Abstract automata theory,” Usp. Mat. Nauk.,16, No. 2, 1–32 (1961).

    Google Scholar 

  3. M. Perles, M. Rabin, and E. Shamir, “The theory of definite automata,” IEEE Trans. Electr. Comp.,12, No. 3, 233–243 (1963).

    MathSciNet  Google Scholar 

  4. A. A. Muchnik, “General linear automata,” Probl. Kibern.,23, 171–208 (1970).

    Google Scholar 

  5. S. Elenberg, Automata, Languages, and machines, Vol. A, Academic Press London (1974).

    Google Scholar 

  6. P. Cohn, Free Rings and Their Dependence [Russian translation], Mir, Moscow (1975).

    Google Scholar 

  7. S. Lang, Algebra [Russian translation], Mir, Moscow (1968).

    Google Scholar 

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

    Google Scholar 

  9. I. Herstein, Noncommutative Rings [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  10. N. Jacobson, Lie Algebras [Russian translation], Mir, Moscow (1964).

    Google Scholar 

  11. É. B. Vinberg, Linear Representations of Groups [in Russian], Nauka, Moscow (1985).

    Google Scholar 

Download references

Authors
  1. I. K. Rystov
    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. 21–26, November–December, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rystov, I.K. Resetting words for decidable automata. Cybern Syst Anal 30, 807–811 (1994). https://doi.org/10.1007/BF02366438

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02366438

Keywords

Search

Navigation