On a Class of Constrained Synchronization Problems in NP
Abstract
The class of known constraint automata for which the constrained synchronization problem is in NP all admit a special form. In this work, we take a closer look at them. We characterize a wider class of constraint automata that give constrained synchronization problems in NP, which encompasses all known problems in NP. We call these automata polycyclic automata. The corresponding language class of polycyclic languages is introduced. We show various characterizations and closure properties for this new language class. We then give a criterion for NP-completeness and a criterion for polynomial time solvability for polycyclic constraint languages.
Cite
@article{arxiv.2006.01903,
title = {On a Class of Constrained Synchronization Problems in NP},
author = {Stefan Hoffmann},
journal= {arXiv preprint arXiv:2006.01903},
year = {2021}
}
Comments
arXiv admin note: text overlap with arXiv:2005.05907; Fixed a claim about closure properties of the polycyclic languages and a formula on page 7, 1st paragraph