A Fast Algorithm Finding the Shortest Reset Words

Abstract

In this paper we present a new fast algorithm finding minimal reset words for finite synchronizing automata. The problem is know to be computationally hard, and our algorithm is exponential. Yet, it is faster than the algorithms used so far and it works well in practice. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and… (More)
DOI: 10.1007/978-3-642-38768-5_18

Topics

4 Figures and Tables

Slides referencing similar topics