Skip to main content
SpringerLink
Log in

Experimental Study of the Shortest Reset Word of Random Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2011)

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

Included in the following conference series:

Abstract

In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental study of the length of the shortest reset word of a finite synchronizing automaton. The largest automata we considered had 100 states. The results of the experiments allow us to formulate a hypothesis that the length of the shortest reset word of a random finite automaton with n states and 2 input letters with high probability is sublinear with respect to n and can be estimated as 1.95 n 0.55.

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.: Slowly synchronizing automata and digraphs. In: Hlinený and Kucera [13], pp. 55–65

    Google Scholar 

  2. Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency. Theor. Comput. Sci. 376(1-2), 30–41 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berlinkov, M.V.: Approximating the Minimum Length of Synchronizing Words Is Hard. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 37–47. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Bulatov, A.A., Skvortsov, E.S.: Phase transition for local search on planted SAT. CoRR, abs/0811.2546 (2008)

    Google Scholar 

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

    Google Scholar 

  6. Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151–158 (1971)

    Google Scholar 

  7. Dantsin, E., Hirsch, E.A., Wolpert, A.: Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 60–68. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Eén, N., Biere, A.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Higgins, P.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum 37, 31–36 (1988), doi:10.1007/BF02573120

    Article  MathSciNet  MATH  Google Scholar 

  12. Hirsch, E.A.: Sat local search algorithms: Worst-case study. J. Autom. Reasoning 24(1/2), 127–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hliněný, P., Kučera, A. (eds.): MFCS 2010. LNCS, vol. 6281. Springer, Heidelberg (2010)

    MATH  Google Scholar 

  14. Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hlinený and Kucera [13], pp. 568–579

    Google Scholar 

  15. Pin, J.-E.: On two combinatorial problems arising from automata theory. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Proceedings of the International Colloquium on Graph Theory and Combinatorics, Combinatorial Mathematics, vol. 75, pp. 535–548. North-Holland, Amsterdam (1983)

    Chapter  Google Scholar 

  16. Roman, A.: Genetic Algorithm for Synchronization. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 684–695. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Evgeny Skvortsov. Google profile, http://profiles.google.com/u/0/108501114510819324139/about

  18. Skvortsov, E.S., Zaks, Y.: Synchronizing random automata. Discrete Mathematics & Theoretical Computer Science 12(4), 95–108 (2010)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Google Inc., USA

    Evgeny Skvortsov

  2. Ural State University, Yekaterinburg, Russia

    Evgeny Tipikin

Authors
  1. Evgeny Skvortsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evgeny Tipikin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Francois Rabelais Tours, 3, Place Jean Jaurès, 4100, Blois, France

    Béatrice Bouchou-Markhoff

  2. LITIS, Université de Rouen, 76801, Saint-Étienne du Rouvray Cedex, France

    Pascal Caron  & Jean-Marc Champarnaud  & 

  3. LI (Computer Laboratory), EPU-DI, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skvortsov, E., Tipikin, E. (2011). Experimental Study of the Shortest Reset Word of Random Automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22256-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22255-9

  • Online ISBN: 978-3-642-22256-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation