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

Synchronization under Dynamic Constraints
Imagine an assembly line where a box with a lid and liquid in it enters ...
read it

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

ComplexityTheoretic Aspects of Expanding Cellular Automata
The expanding cellular automata (XCA) variant of cellular automata is in...
read it

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

On PrefixSorting Finite Automata
Being able to efficiently test the membership of a word in a formal lang...
read it

Genetic Algorithm for the Weight Maximization Problem on Weighted Automata
The weight maximization problem (WMP) is the problem of finding the word...
read it
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
We investigate the constrained synchronization problem for weakly acyclic, or partially ordered, input automata. We show that, for input automata of this type, the problem is always in NP. Furthermore, we give a full classification of the realizable complexities for constraint automata with at most two states and over a ternary alphabet. We find that most constrained problems that are PSPACEcomplete in general become NPcomplete. However, there also exist constrained problems that are PSPACEcomplete in the general setting but become polynomial time solvable when considered for weakly acyclic input automata. We also investigate two problems related to subset synchronization, namely if there exists a word mapping all states into a given target subset of states, and if there exists a word mapping one subset into another. Both problems are PSPACEcomplete in general, but in our setting the former is polynomial time solvable and the latter is NPcomplete.
READ FULL TEXT
Comments
There are no comments yet.