License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.63
URN: urn:nbn:de:0030-drops-110078
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11007/
Go to the corresponding LIPIcs Volume Portal


Fernau, Henning ; Gusev, Vladimir V. ; Hoffmann, Stefan ; Holzer, Markus ; Volkov, Mikhail V. ; Wolf, Petra

Computational Complexity of Synchronization under Regular Constraints

pdf-format:
LIPIcs-MFCS-2019-63.pdf (0.6 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{fernau_et_al:LIPIcs:2019:11007,
  author =	{Henning Fernau and Vladimir V. Gusev and Stefan Hoffmann and Markus Holzer and Mikhail V. Volkov and Petra Wolf},
  title =	{{Computational Complexity of Synchronization under Regular Constraints}},
  booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  pages =	{63:1--63:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-117-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{138},
  editor =	{Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11007},
  URN =		{urn:nbn:de:0030-drops-110078},
  doi =		{10.4230/LIPIcs.MFCS.2019.63},
  annote =	{Keywords: Finite automata, synchronization, computational complexity}
}

Keywords: Finite automata, synchronization, computational complexity
Seminar: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Issue Date: 2019
Date of publication: 23.08.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI