Generating Shortest Synchronizing Sequences using Answer Set Programming
Artificial Intelligence
2013-12-24 v1
Abstract
For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be performed in polynomial time. However, the problem of finding a shortest synchronizing sequence is known to be NP-hard. In this work, the usefulness of Answer Set Programming to solve this optimization problem is investigated, in comparison with brute-force algorithms and SAT-based approaches. Keywords: finite automata, shortest synchronizing sequence, ASP
Keywords
Cite
@article{arxiv.1312.6146,
title = {Generating Shortest Synchronizing Sequences using Answer Set Programming},
author = {Canan Güniçen and Esra Erdem and Hüsnü Yenigün},
journal= {arXiv preprint arXiv:1312.6146},
year = {2013}
}
Comments
Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey