Skip to main content
SpringerLink
Log in

Synchronizing Automata on Quasi-Eulerian Digraph

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

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

Included in the following conference series:

  • 585 Accesses

Abstract

We describe a new version of the so-called extension method that was used to prove quadratic upper bounds on the minimum length of reset words for various important classes of synchronizing automata. Our approach is formulated in terms of Markov chains; it is in a sense dual to the usual extension method and improves on a recent result by Jungers. As an application, we obtain a quadratic upper bound on the minimum length of reset words for a generalization of Eulerian automata.

Supported by the Russian Foundation for Basic Research, grant 10-01-00793, and by the Presidential Program for young researchers, grant MK-266.2012.1.

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., Gusev, V., Volkov, M.: Slowly Synchronizing Automata and Digraphs. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 55–65. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Berlinkov, M.: On a conjecture by Carpi and D’Alessandro. Int. J. Found. Comput. Sci. 22(7), 1565–1576 (2011)

    Article  MathSciNet  Google Scholar 

  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)

    MATH  Google Scholar 

  4. Dubuc, L.: Sur les automates circulaires et la conjecture de Černý. RAIRO Inform. Théor. Appl. 32, 21–34 (1998) (in French)

    MathSciNet  Google Scholar 

  5. Dulmage, A.L., Mendelsohn, N.S.: Gaps in the exponent set of primitive matrices. Ill. J. Math. 8, 642–656 (1964)

    MathSciNet  MATH  Google Scholar 

  6. Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb. 3, 125–127 (1982)

    MathSciNet  MATH  Google Scholar 

  7. Jungers, M.: The synchronizing probability function of an automaton. SIAM J. Discrete Math. 26, 177–192 (2011)

    Article  MathSciNet  Google Scholar 

  8. Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci. 295, 223–232 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)

    Book  MATH  Google Scholar 

  10. Pin, J.-E.: Le problème de la synchronization et la conjecture de Cerny, Thèse de 3ème cycle. Université de Paris 6 (1978)

    Google Scholar 

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

    MATH  Google Scholar 

  12. Steinberg, B.: The Černý conjecture for one-cluster automata with prime length cycle. Theoret. Comput. Sci. 412(39), 5487–5491 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Steinberg, B.: The averaging trick and the Černý conjecture. Int. J. Found. Comput. Sci. 22(7), 1697–1706 (2011)

    Article  Google Scholar 

  14. Trahtman, A.N.: Modifying the Upper Bound on the Length of Minimal Synchronizing Word. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 173–180. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. 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 

  16. Wielandt, H.: Unzerlegbare, nicht negative Matrizen. Math. Z 52, 642–648 (1950) (in German)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Mikhail V. Berlinkov

Authors
  1. Mikhail V. Berlinkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berlinkov, M.V. (2012). Synchronizing Automata on Quasi-Eulerian Digraph. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31606-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31605-0

  • Online ISBN: 978-3-642-31606-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation