文章基本信息

标题：Computational Complexity of Synchronization under Regular Constraints
本地全文：下载
作者：Henning Fernau ; Vladimir V. Gusev ; Stefan Hoffmann 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：138
页码：1-14
DOI：10.4230/LIPIcs.MFCS.2019.63
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Many variations of synchronization of finite automata have been studied in the previous decades. Here, we suggest studying the question if synchronizing words exist that belong to some fixed constraint language, given by some partial finite automaton called constraint automaton. We show that this synchronization problem becomes PSPACE-complete even for some constraint automata with two states and a ternary alphabet. In addition, we characterize constraint automata with arbitrarily many states for which the constrained synchronization problem is polynomial-time solvable. We classify the complexity of the constrained synchronization problem for constraint automata with two states and two or three letters completely and lift those results to larger classes of finite automata.
关键词：Finite automata; synchronization; computational complexity