Experiments with Synchronizing Automata
Formal Languages and Automata Theory
2016-07-15 v1
Abstract
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing the results. In particular, we have verified the \v{C}ern\'y conjecture for all binary automata with at most 12 states, and all ternary automata with at most 8 states.
Keywords
Cite
@article{arxiv.1607.04025,
title = {Experiments with Synchronizing Automata},
author = {Andrzej Kisielewicz and Jakub Kowalski and Marek Szykuła},
journal= {arXiv preprint arXiv:1607.04025},
year = {2016}
}
Comments
CIAA 2016. The final publication available at http://link.springer.com/chapter/10.1007/978-3-319-40946-7_15