
Computational Complexity of Synchronization under Regular Commutative Constraints
Here we study the computational complexity of the constrained synchroniz...
read it

Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents
For general input automata, there exist regular constraint languages suc...
read it

On a Class of Constrained Synchronization Problems in NP
The class of known constraint automata for which the constrained synchro...
read it

Efficient Folding Algorithms for Regular Polyhedra
We investigate the folding problem that asks if a polygon P can be folde...
read it

Discrete event simulation of point processes: A computational complexity analysis on sparse graphs
We derive new discrete event simulation algorithms for marked time point...
read it

The algebraic structure of the densification and the sparsification tasks for CSPs
The tractability of certain CSPs for dense or sparse instances is known ...
read it

Regular matroids have polynomial extension complexity
We prove that the extension complexity of the independence polytope of e...
read it
Computational Complexity of Synchronization under Sparse Regular Constraints
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 letterbounded regular constraint languages, which properly contain the strictly bounded regular languages. Then, we introduce strongly selfsynchronizing 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 NPcomplete or polynomial time solvable.
READ FULL TEXT
Comments
There are no comments yet.