On the Cerny conjecture

Sun, 19/04/2015 - 12:00
Speaker: 
Place: 
Abstract: 

The Cerny conjecture, concerned with the minimal length of a reset word in a finite automata, is considered one of the most longstanding open problem in the theory of finite automata. ​In this talk, w​e ​discuss​ ​the background of the conjecture, attempts at a proof, and partial results obtained so far by various researchers. In the second part, we present our recent results, which shade a light on the question of why the conjecture is so hard to prove.