Advertisement

Journal of Algebraic Combinatorics

, Volume 50, Issue 3, pp 237–253 | Cite as

A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number

  • Emanuele RodaroEmail author
Article
First Online:
  • 46 Downloads

Abstract

We show that if a semisimple synchronizing automaton with n states has a minimal reachable non-unary subset of cardinality \(r\ge 2\), then there is a reset word of length at most \((n-1)D(2,r,n)\), where D(2, r, n) is the 2-packing number for families of r-subsets of [1, n].

Keywords

Synchronizing automaton Černý’s conjecture Packing number Simple automaton Semisimple automaton Wedderburn–Artin theorem 

Mathematics Subject Classification

68Q70 68Q45 05E99 05B40 20M30 16D60 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

The author thanks the anonymous referees for the careful reading of the paper and precious comments and suggestions, especially for pointing out the better bound for the case of former-rank 3 using Pin–Frank’s approach. The author acknowledges support from INDAM-GNSAGA.

References

  1. 1.
    Almeida, J., Margolis, S., Steinberg, B., Volkov, M.V.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc. 361(3), 1429–1461 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Almeida, J., Rodaro, E.: Semisimple synchronizing automata and the Wedderburn–Artin theory. Int. J. Found. Comput. Sci. 27(2), 127–145 (2016)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Almeida, J., Steinberg, B.: Matrix mortality and the Černý-Pin conjecture. In: Diekert, V., Nowotka, D. (eds.) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol. 5583, pp. 67–80. Springer, Berlin (2009)CrossRefGoogle Scholar
  4. 4.
    Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1), 3–13 (2005)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Ananichev, D.S., Volkov, M.V., Gusev, V.V.: Primitive digraphs with large exponents and slowly synchronizing automata. J. Math. Sci. 192(3), 263–278 (2013)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Arnold, F., Steinberg, B.: Synchronizing groups and automata. Theor. Comput. Sci. 359(1–3), 101–110 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Babcsányi, I.: Automata with finite congruence lattices. Acta Cybernet. 18(1), 155–165 (2007)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Béal, M.-P., Berlinkov, M.V., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci. 22(2), 277–288 (2011)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Berlinkov, M., Szykuła, M.: Algebraic synchronization criterion and computing reset words. Inform. Sci. 369, 718–730 (2016)CrossRefGoogle Scholar
  10. 10.
    Brouwer, A.E.: Block designs. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. 1. Elsevier, Amsterdam (1995)Google Scholar
  11. 11.
    Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Mat.-Fyz. Čas. Slovensk. Akad. Vied. 14, 208–216 (1964). [in Slovak]Google Scholar
  12. 12.
    Dubuc, L.: Sur les automates circulaires et la conjecture de Černý. Informatique théorique et applications 32, 21–34 (1998). [in French]MathSciNetCrossRefGoogle Scholar
  13. 13.
    Grech, M., Kisielewicz, A.: The Černý conjecture for automata respecting intervals of a directed graph. Discrete Math. Theor. Comput. Sci. 15(3), 61–72 (2013)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Boston (1979)zbMATHGoogle Scholar
  15. 15.
    Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theor. Comput. Sci. 295(1–3), 223–232 (2003)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Lam, T.Y.: A First Course in Noncommutative Rings. Springer, New York (2001)CrossRefGoogle Scholar
  17. 17.
    Perrin, D.: Finite automata. In: van Leewen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 1–57. Elsevier, Amsterdam (1990)Google Scholar
  18. 18.
    Pin, J.-É.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535–548 (1983)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Rystsov, I.K.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172(1–2), 273–279 (1997)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Rystsov, I.K.: Primitive and irreducible automata. Cybernet. Systems Anal. 51(4), 506–513 (2015)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Steinberg, B.: The Černý conjecture for one-cluster automata with prime length cycle. Theor. Comput. Sci. 412(39), 5487–5491 (2011)CrossRefGoogle Scholar
  22. 22.
    Szykuła, M.: Improving the upper bound on the length of the shortest reset word. In: Niedermeier, R., Vallée, B. (eds.) 35th Symposium Theoretical Aspects of Computer Science, STACS 2018 [Leibniz International Proceedings Informatics 96], Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 56:1–56:13 (2018)Google Scholar
  23. 23.
    Thierrin, G.: Simple automata. Kybernetika 6(5), 343–350 (1970)MathSciNetzbMATHGoogle Scholar
  24. 24.
    Trahtman, A.N.: The Černý conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci. 9(2), 3–10 (2007)MathSciNetzbMATHGoogle Scholar
  25. 25.
    Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martn-Vide C., Otto F., Fernau H. (eds.) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol. 5196, pp. 11–27. Springer, Berlin (2008)Google Scholar
  26. 26.
    Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theor. Comput. Sci. 410, 3513–3519 (2009)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Dipartimento di MatematicaPolitecnico di MilanoMilanItaly

Personalised recommendations

Cite article

Buy options