Slowly synchronizing automata with zero and incomplete sets
Formal Languages and Automata Theory
2009-07-28 v1
Abstract
Using combinatorial properties of incomplete sets in a free monoid we construct a series of n-state deterministic automata with zero whose shortest synchronizing word has length n^2/4+n/2-1.
Keywords
Cite
@article{arxiv.0907.4576,
title = {Slowly synchronizing automata with zero and incomplete sets},
author = {E. V. Pribavkina},
journal= {arXiv preprint arXiv:0907.4576},
year = {2009}
}
Comments
9 pages, 6 figures