Skip to main content
SpringerLink
Log in

Rank of a finite automaton

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

Abstract

The notion of rank of a finite automaton is considered. The Cerny—Pin conjecture about the length of terminal words in finite abstract automata is generalized to linear automata.

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. J. Cerny, “Poznamka k homogennym experimentom s konecnymy automatami,” Math. Fyz. Cas. SAV,14, 208–215 (1964).

    Google Scholar 

  2. E. Pin, “Sur un cas particulier de la conjecture de Cerny,” Lect. Notes Comp. Sci.,62, 345–352 (1978).

    Google Scholar 

  3. E. Pin, “La probleme de la synchronisation et la conjecture de Cerny,” Quaderni Ric. Sci.,109, 37–48 (1981).

    Google Scholar 

  4. V. M. Glushkov, “Abstract automata theory,” UMN,16, No. 2, 1–32 (1961).

    Google Scholar 

  5. I. K. Rystsov, “Bound on the length of a nuclear word for a finite automaton,” in: Automata [in Russian], SGU, Saratov, No. 2, 43–48 (1977).

    Google Scholar 

  6. I. K. Rystsov and M. A. Spivak, “Bound on the length of the shortest word of a given rank in an automaton,” Kibernetika, No. 6, 113 (1990).

    Google Scholar 

  7. J. Cerny, A. Pirica, and B. Rosenauerova, “On directable automata,” Kybernetika,7, No. 4, 289–298 (1971).

    Google Scholar 

  8. I. K. Rystsov, “Polynomial complete problems in automata theory,” Inform. Proc. Lett,16, No. 3, 147–151 (1983).

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. D. Kfoury, “Synchronizing sequences for probabilistic automata,” Stud. Appl. Math.,49, No. 1, 101–103 (1970).

    Google Scholar 

  12. M. Paterson, “Unsolvability in 3 × 3 matrices,” Stud. Appl. Math.,49, No. 1, 104–107 (1970).

    Google Scholar 

Download references

Authors
  1. I. K. Rystsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 3–10, May–June, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rystsov, I.K. Rank of a finite automaton. Cybern Syst Anal 28, 323–328 (1992). https://doi.org/10.1007/BF01125412

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation