Computational Complexity of Synchronization under Sparse Regular Constraints

07/30/2021
by   Stefan Hoffmann, et al.
0

The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints. It could be viewed as a special case of synchronization of a discrete event system under supervisory control. Here, we study the computational complexity of this problem for the class of sparse regular constraint languages. We give a new characterization of sparse regular sets, which equal the bounded regular sets, and derive a full classification of the computational complexity of CSP for letter-bounded regular constraint languages, which properly contain the strictly bounded regular languages. Then, we introduce strongly self-synchronizing codes and investigate CSP for bounded languages induced by these codes. With our previous result, we deduce a full classification for these languages as well. In both cases, depending on the constraint language, our problem becomes NP-complete or polynomial time solvable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2020

Computational Complexity of Synchronization under Regular Commutative Constraints

Here we study the computational complexity of the constrained synchroniz...
research
09/06/2021

Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents

For general input automata, there exist regular constraint languages suc...
research
06/02/2020

On a Class of Constrained Synchronization Problems in NP

The class of known constraint automata for which the constrained synchro...
research
08/16/2021

Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata

We investigate the constrained synchronization problem for weakly acycli...
research
03/14/2019

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques

Regular expressions with backreferences (regex, for short), as supported...
research
04/11/2021

The algebraic structure of the densification and the sparsification tasks for CSPs

The tractability of certain CSPs for dense or sparse instances is known ...
research
09/06/2023

Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars

Tree-controlled grammars are context-free grammars where the derivation ...

Please sign up or login with your details

Forgot password? Click here to reset