Skip to main content
SpringerLink
Log in

Synchronizing Automata with Random Inputs

(Short Paper)

  • Conference paper
Developments in Language Theory (DLT 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8633))

Included in the following conference series:

  • 480 Accesses

Abstract

We study the problem of synchronization of automata with random inputs. We present a series of automata such that the expected number of steps until synchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous Černý automata is at most cubic in the number of states.

Supported by the Presidential Program for Young Researchers, grant MK-3160.2014.1 and by the Russian Foundation for Basic Research, grant 13-01-00852.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ananichev, D.S., Gusev, V.V., Volkov, M.V.: Primitive digraphs with large exponents and slowly synchronizing automata. Journal of Mathematical Sciences (US) 192(3), 263–278 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berlinkov, M.V.: On the probability of being synchronizable (2013), ArXiv: http://arxiv.org/abs/1304.5774

  3. Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Matematicko-fyzikalny Časopis Slovensk. Akad. Vied 14(3), 208–216 (1964) (in Slovak)

    Google Scholar 

  4. Gusev, V.V.: Lower bounds for the length of reset words in eulerian automata. Int. J. Found. Comput. Sci. 24(2), 251–262 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  5. Jungers, R.M.: The synchronizing probability function of an automaton. SIAM J. Discret. Math. 26(1), 177–192 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kisielewicz, A., Kowalski, J., Szykuła, M.: A Fast Algorithm Finding the Shortest Reset Words. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 182–196. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535–548 (1983)

    MATH  Google Scholar 

  8. Privault, N.: Understanding Markov Chains. Springer (2013)

    Google Scholar 

  9. Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Skvortsov, E.S., Zaks, Y.: Synchronizing random automata. Discr. Math. and Theor. Comp. Sci. 12(4), 95–108 (2010)

    MATH  MathSciNet  Google Scholar 

  11. Skvortsov, E., Tipikin, E.: Experimental study of the shortest reset word of random automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 290–298. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theoret. Comput. Sci. 410, 2992–2998 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Zaks, Y.I., Skvortsov, E.S.: Synchronizing random automata on a 4-letter alphabet. Journal of Mathematical Sciences 192(3), 303–306 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia

    Vladimir V. Gusev

Authors
  1. Vladimir V. Gusev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Ural Federal University, pr. Lenina, 51, 620000, Ekaterinburg, Russia

    Arseny M. Shur  & Mikhail V. Volkov  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gusev, V.V. (2014). Synchronizing Automata with Random Inputs. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09698-8_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09697-1

  • Online ISBN: 978-3-319-09698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation