Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents

09/06/2021 ∙ by Stefan Hoffmann, et al. ∙ 0

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 PSPACE-complete or NP-complete. 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.



There are no comments yet.


page 1

page 3

page 5

page 8

page 9

page 13

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.