Computing the shortest reset words of synchronizing automata

Andrzej Kisielewicz (), Jakub Kowalski () and Marek Szykuła ()
Additional contact information
Andrzej Kisielewicz: University of Wrocław
Jakub Kowalski: University of Wrocław
Marek Szykuła: University of Wrocław

Journal of Combinatorial Optimization, 2015, vol. 29, issue 1, No 6, 88-124

Abstract: Abstract In this paper we give the details of our new algorithm for finding minimal reset words of finite synchronizing automata. 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 breadth-first-search and radix (Patricia) tries to store and compare subsets. A good performance is due to a number of heuristics we apply and describe here in a suitable detail. 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 up to $$n=350$$ n = 350 states and up to $$k=10$$ k = 10 input letters. In particular, we obtain a new estimation of the expected length of the shortest reset word $${\approx \,}2.5\sqrt{n-5}$$ ≈ 2.5 n - 5 for binary automata and show that the error of this estimate is sufficiently small. Experiments for automata with more than two input letters show certain trends with the same general pattern.

Keywords: Synchronizing automaton; Synchronizing word; Černý conjecture (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9682-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-013-9682-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9682-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().