Slowly synchronizing automata and digraphs
Formal Languages and Automata Theory
2014-11-25 v1 Discrete Mathematics
Abstract
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. These automata are closely related to primitive digraphs with large exponent.
Keywords
Cite
@article{arxiv.1005.0129,
title = {Slowly synchronizing automata and digraphs},
author = {Dmitry S. Ananichev and Vladimir V. Gusev and Mikhail V. Volkov},
journal= {arXiv preprint arXiv:1005.0129},
year = {2014}
}
Comments
13 pages, 5 figures