Skip to main content
SpringerLink
Log in

A lower bound for the length of the shortest carefully synchronizing words

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We introduce the notion of careful synchronization for partial finite automata as a natural generalization of the synchronization notion for complete finite automata. We obtain a lower bound for the careful synchronization threshold for automata with a given number of states.

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. Černý, “Poznámka kHomogénnym Eksperimentom s Konečnými Automatami,” Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14(3), 208–216 (1964).

    MATH  Google Scholar 

  2. L. Dubuc, “Sur les Automates Circulaires et la Conjecture de Černý,” RAIRO Inform. Theor. Appl. 32(1–3), 21–34 (1998).

    MathSciNet  Google Scholar 

  3. D. Eppstein, “Reset Sequences for Monotonic Automata,” SIAM J. Comput. 19(3), 500–510 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Kari, “Synchronizing Finite Automata on Eulerian Digraphs,” Theoret. Comput. Sci. 295(1–3), 223–232 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  5. J.-E. Pin, “On Two Combinatorial Problems Arising From Automata Theory,” Ann. Discrete Math. 17, 535–548 (1983).

    MATH  Google Scholar 

  6. M. Ito and K. Shikishima-Tsuji, “Some Results on Directable Automata,” in: Theory Is Forever. Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday (Lect. Notes Comp. Sci., Springer, Berlin, 2004), Vol. 3113, pp. 125–133.

    Google Scholar 

  7. M. Ito, Algebraic Theory of Automata and Languages (World Scientific, Singapore, 2004).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, ul. Lenina 51, Ekaterinburg, 620083, Russia

    P. V. Martyugin

Authors
  1. P. V. Martyugin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. V. Martyugin.

Additional information

Original Russian Text © P.V. Martyugin, 2010, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, No. 1, pp. 59–68.

About this article

Cite this article

Martyugin, P.V. A lower bound for the length of the shortest carefully synchronizing words. Russ Math. 54, 46–54 (2010). https://doi.org/10.3103/S1066369X10010056

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X10010056

Key words and phrases

Search

Navigation