Skip to main content
SpringerLink
Log in

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

  • Published:
Cybernetics 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

Literature Cited

  1. M. Fishler and M. Tanenbaum, “Synchronizing and representation problems for sequential machines with masked outputs,” IEEE Conf. Record, 11th Ann. Symp. Switching and Automata Theory, New York (1970), pp. 97–103.

  2. Z. Kohavi and J. Winograd, “Establishing certain bounds concerning finite automata,” J. Computer System Sci.,7, No. 2, 288–299 (1973).

    Google Scholar 

  3. G. Katona, “Solution of a problem of Erenfeucht-Mycielski,” J. Comb. Theory (A),17, No. 2, 265–266 (1974).

    Google Scholar 

  4. I. K. Rystsov and M. A. Spivak, “Investigation of irredundant sequences of sets,” in: Mathematical Theory of Computer Design [in Russian], IK AN UkrSSR, Kiev (1978), pp. 13–27.

    Google Scholar 

  5. A. G. Kurosh, A Course in Higher Algebra [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  6. I. K. Rystsov, “On minimizing the length of a synchronizing word for finite automata,” in: Theoretical Issues of Computer System Design [in Russian], IK AN UkrSSR, Kiev (1980), pp. 75–82.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  9. L. Matthews, “Closure in independence systems,” Math. Oper. Res.,7, No. 2, 159–171 (1982).

    Google Scholar 

  10. M. Aigner, Combinatorial Theory [Russian translation], Mir, Moscow (1982).

    Google Scholar 

Download references

Authors
  1. A. A. Klyachko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. K. Rystsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. A. Spivak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 16–20, 25, March–April, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klyachko, A.A., Rystsov, I.K. & Spivak, M.A. In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton. Cybern Syst Anal 23, 165–171 (1987). https://doi.org/10.1007/BF01071771

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation