Computational Complexity of Synchronization under Regular Constraints

Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf, Michael Wagner
2019 International Symposium on Mathematical Foundations of Computer Science  
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
more » ... r 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.
doi:10.4230/lipics.mfcs.2019.63 dblp:conf/mfcs/FernauGHHVW19 fatcat:2mdtzpytebduhesbhhibrolscm