6533b7d8fe1ef96bd126a297

RESEARCH PRODUCT

A Fast Algorithm Finding the Shortest Reset Words

Marek SzykułaAndrzej KisielewiczAndrzej KisielewiczJakub Kowalski

subject

Computer scienceBranching factorSynchronizing wordApproxHeuristicsReset (computing)AlgorithmComputer Science::Formal Languages and Automata TheoryWord (computer architecture)AutomatonExponential function

description

In this paper we present a new fast algorithm for finding minimal reset words for finite synchronizing automata, which is a problem appearing in many practical applications. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare subsets. Also a number of heuristics are applied. We give both theoretical and practical arguments showing that the effective branching factor is considerably reduced. As a practical test we perform an experimental study of the length of the shortest reset word for random automata with n ≤ 300 states and 2 input letters. In particular, we obtain a new estimation of the expected length of the shortest reset word \(\approx 2.5\sqrt{n-5}\).

yearjournalcountryeditionlanguage
2013-01-01
https://doi.org/10.1007/978-3-642-38768-5_18