
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
We investigate the constrained synchronization problem for weakly acycli...
read it

Constraint Synchronization with Two or Three State Partial Constraint Automata
Here, we study the question if synchronizing words exist that belong to ...
read it

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

Testing Membership for Timed Automata
Given a timed automata which admits thick components and a timed word x,...
read it

Distributed graph problems through an automatatheoretic lens
We study the following algorithm synthesis question: given the descripti...
read it

On synchronization of partial automata
A goal of this paper is to introduce the new construction of an automato...
read it

Computational Complexity of Synchronization under Sparse Regular Constraints
The constrained synchronization problem (CSP) asks for a synchronizing w...
read it
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents
For general input automata, there exist regular constraint languages such that asking if a given input automaton admits a synchronizing word in the constraint language is PSPACEcomplete or NPcomplete. Here, we investigate this problem for commutative automata over an arbitrary alphabet and automata with simple idempotents over a binary alphabet as input automata. The latter class contains, for example, the Černý family of automata. We find that for commutative input automata, the problem is always solvable in polynomial time, for every constraint language. For input automata with simple idempotents over a binary alphabet and with a constraint language given by a partial automaton with up to three states, the constrained synchronization problem is also solvable in polynomial time.
READ FULL TEXT
Comments
There are no comments yet.