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.

Data and Resources

Cite this as

Canan G¨uni¸cen, Esra Erdem, H¨usn¨u Yenig¨un (2024). Dataset: Generating Shortest Synchronizing Sequences using ASP. https://doi.org/10.57702/sn0gsdsz

DOI retrieved: December 16, 2024

Additional Info

Field Value
Created December 16, 2024
Last update December 16, 2024
Defined In https://doi.org/10.48550/arXiv.1312.6146
Author Canan G¨uni¸cen
More Authors
Esra Erdem
H¨usn¨u Yenig¨un
Homepage https://arxiv.org/abs/2303.12345