Generating Synchronizing Automata with Large Reset Lengths
Formal Languages and Automata Theory
2018-03-29 v4
Abstract
We study synchronizing automata with the shortest reset words of relatively large length. First, we refine the Frankl-Pin result on the length of the shortest words of rank , and the B\'eal, Berlinkov, Perrin, and Steinberg results on the length of the shortest reset words in one-cluster automata. The obtained results are useful in computation aimed in extending the class of small automata for which the \v{C}ern\'y conjecture is verified and discovering new automata with special properties regarding synchronization.
Keywords
Cite
@article{arxiv.1404.3311,
title = {Generating Synchronizing Automata with Large Reset Lengths},
author = {Andrzej Kisielewicz and Marek Szykuła},
journal= {arXiv preprint arXiv:1404.3311},
year = {2018}
}