Generating Shortest Synchronizing Sequences using ASP
The problem of finding a shortest synchronizing sequence for a finite state automaton (FA) is formulated in Answer Set Programming (ASP). Four different ASP formulations are given. Also an extension of the SAT formulation of the same problem given in [16] is suggested.
BibTex: