The Cerny conjecture for automata respecting intervals of a directed graph
Formal Languages and Automata Theory
2012-07-12 v1
Abstract
The \v{C}ern\'y'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 of automata preserving certain properties of intervals of a directed graph. Our result unifies and generalizes some earlier results obtained by other authors.
Keywords
Cite
@article{arxiv.1207.2556,
title = {The Cerny conjecture for automata respecting intervals of a directed graph},
author = {M. Grech and A. Kisielewicz},
journal= {arXiv preprint arXiv:1207.2556},
year = {2012}
}