pith. sign in

arxiv: 1308.1978 · v1 · pith:RQ76FF3Rnew · submitted 2013-08-08 · 💻 cs.FL · cs.DS

A New Heuristic Synchronizing Algorithm

classification 💻 cs.FL cs.DS
keywords algorithmheuristicalgorithmsautomatonaveragebreadth-first-searchcalledcase
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.