Generating Shortest Synchronizing Sequences using ASP
收藏DataCite Commons2024-12-16 更新2025-04-16 收录
下载链接：
https://service.tib.eu/ldmservice/dataset/ac73b735-d16d-4997-8a00-421145818304
下载链接
链接失效反馈官方服务：
资源简介：
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.
提供机构：
TIB
创建时间：
2024-12-16
