Doctoral student Josephine Walk will present “Sixty Years of the Černý Conjecture: A Survey of Theoretical Improvements, Computational Efforts & Applications” for the mathematics and statistical sciences colloquium on Friday, Nov. 14, at 1 p.m.
In the 1960s, mathematician Ján Černý suggested that the length of the shortest reset word for a synchronizing automaton with n states is no more than (n-1)2. This idea, now known as the Černý Conjecture, has been an interesting open problem in automata theory for over six decades. In this talk, we will become acquainted with synchronizing automata, explore theoretical and computational efforts to validate or invalidate the Černý Conjecture, and survey applications of synchronizing automata. You may even see a magic trick!
The seminar will be held in Cudahy Hall 401 and virtually via Teams. Post-colloquium refreshments will be served in Cudahy Hall 342 after 2 p.m. Find more information on mathematical and statistical sciences here, or contact Dr. Naveen Bansal.
