This is a computational package with algorithms for finding synchronizing (reset) words of a deterministic finite automaton. In particular, the package contains an implementation of the fastest known algorithm computing the (length of) shortest reset words.

If you are using it for research, please refer to the following paper:

• Marek Szykuła and Adam Zyzik. An Improved Algorithm for Finding the Shortest Synchronizing Words. In European Symposium on Algorithms (ESA 2022), volume 202 of LIPIcs, pages 46:1--46:14, 2022, [doi]. Full version at [arxiv].

The related version used in these experiments is 1.1.0.

• Installation and usage

• Configuration files and available algorithms

Authors

• Marek Szykuła (2022)

• Adam Zyzik (2022)