The Cerny conjecture for automata respecting intervals of a directed graph

M. Grech, A. Kisielewicz

The Černý's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n-11)^2. We prove this conjecture for a class…