On the Cerny conjecture
Seminar
Speaker
Andrzej Kisielewicz (Wroclaw)
Date
19/04/2015 - 13:00 - 12:00Add to Calendar
2015-04-19 12:00:00
2015-04-19 13:00:00
On the Cerny conjecture
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, we 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.
Seminar room
אוניברסיטת בר-אילן - Department of Mathematics
mathoffice@math.biu.ac.il
Asia/Jerusalem
public
Place
Seminar room
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, we 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.
Last Updated Date : 13/04/2015
