Skip to main content
SpringerLink
Log in

The Averaging Trick and the Černý Conjecture

  • Conference paper
Developments in Language Theory (DLT 2010)

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

Included in the following conference series:

Abstract

The results of several papers concerning the Černý conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof scheme axiomatically. Instead, authors axiomatized classes of automata to which it applies.

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. Černý, J.: A remark on homogeneous experiments with finite automata. Mat.-Fyz. Časopis Sloven. Akad. Vied 14, 208–216 (1964)

    MATH  Google Scholar 

  2. Pin, J.E.: Sur un cas particulier de la conjecture de Cerny. In: Automata, languages and programming, Fifth Internat. Colloq., Udine. LNCS, vol. 62, pp. 345–352. Springer, Berlin (1978)

    Google Scholar 

  3. Pin, J.E.: Le problème de la synchronisation et la conjecture de Černý. In: Noncommutative structures in algebra and geometric combinatorics (Naples, 1978). Quad. “Ricerca Sci.” CNR, Rome, vol. 109, pp. 37–48 (1981)

    Google Scholar 

  4. Arnold, F., Steinberg, B.: Synchronizing groups and automata. Theoret. Comput. Sci. 359, 101–110 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Rystsov, I.K.: Quasioptimal bound for the length of reset words for regular automata. Acta Cybernet. 12, 145–152 (1995)

    MATH  MathSciNet  Google Scholar 

  8. Rystsov, I.K.: On the length of reset words for automata with simple idempotents. Kibernet. Sistem. Anal. 187, 32–39 (2000)

    MathSciNet  Google Scholar 

  9. Almeida, J., Margolis, S., Steinberg, B., Volkov, M.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc. 361, 1429–1461 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Trahtman, A.N.: The Černý conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci. 9, 3–10 (2007) (electronic)

    MATH  MathSciNet  Google Scholar 

  11. Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 789–800. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Ananichev, D.S., Volkov, M.V.: Some results on Černý type problems for transformation semigroups. In: Semigroups and Languages, pp. 23–42. World Sci. Publ., River Edge (2004)

    Chapter  Google Scholar 

  13. Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci. 295, 223–232 (2003); Mathematical foundations of computer science (Mariánské Lázně, 2001)

    Google Scholar 

  14. Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theoret. Comput. Sci. 330, 3–13 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Rystsov, I.: Reset words for commutative and solvable automata. Theoret. Comput. Sci. 172, 273–279 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Rystsov, I.C.: On the rank of a finite automaton. Kibernet. Sistem. Anal. 187, 3–10 (1992)

    MathSciNet  Google Scholar 

  17. Steinberg, B.: Černý’s conjecture and group representation theory. J. Algebr. Comb. 31, 83–109 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 146 (2001)

    Google Scholar 

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

  20. Béal, M.P., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 81–90. Springer, Berlin (2009)

    Google Scholar 

  21. Carpi, A., d’Alessandro, F.: The synchronization problem for strongly transitive automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 240–251. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Carpi, A., d’Alessandro, F.: The synchronization problem for locally strongly transitive automata. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 211–222. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Almeida, J., Steinberg, B.: Matrix mortality and the Černý-Pin conjecture. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 67–80. Springer, Berlin (2009)

    Google Scholar 

  24. Béal, M.P.: A note on Cerny’s conjecture and rational series (2003) (unpublished)

    Google Scholar 

  25. Salomaa, A.: Composition sequences for functions over a finite domain. Theoret. Comput. Sci. 292, 263–281 (2003); Selected papers in honor of Jean Berstel

    Article  MATH  MathSciNet  Google Scholar 

  26. Pin, J.E.: On two combinatorial problems arising from automata theory. In: Combinatorial Mathematics (Marseille-Luminy, 1981). North-Holland Math. Stud., vol. 75, pp. 535–548. North-Holland, Amsterdam (1983)

    Google Scholar 

  27. Berstel, J., Reutenauer, C.: Rational series and their languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Berlin (1988)

    MATH  Google Scholar 

  28. Béal, M.P., Berlinkov, M.V., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. International Journal of Foundations of Computer Science (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada

    Benjamin Steinberg

Authors
  1. Benjamin Steinberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Steinberg, B. (2010). The Averaging Trick and the Černý Conjecture. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation