A New Heuristic Synchronizing Algorithm
Formal Languages and Automata Theory
2013-08-12 v1 Data Structures and Algorithms
Abstract
We present a new heuristic algorithm finding reset words. The algorithm called CutOff-IBFS is based on a simple idea of inverse breadth-first-search in the power automaton. We perform an experimental investigation of effectiveness compared to other algorithms existing in literature, which yields that our method generally finds a shorter word in an average case and works well in practice.
Cite
@article{arxiv.1308.1978,
title = {A New Heuristic Synchronizing Algorithm},
author = {Jakub Kowalski and Marek Szykuła},
journal= {arXiv preprint arXiv:1308.1978},
year = {2013}
}