2 research outputs found
Finitely generated ideal languages and synchronizing automata
We study representations of ideal languages by means of strongly connected
synchronizing automata. For every finitely generated ideal language L we
construct such an automaton with at most 2^n states, where n is the maximal
length of words in L. Our constructions are based on the De Bruijn graph.Comment: Submitted to WORDS 201
Complexity of checking whether two automata are synchronized by the same language
A deterministic finite automaton is said to be synchronizing if it has a
reset word, i.e. a word that brings all states of the automaton to a particular
one. We prove that it is a PSPACE-complete problem to check whether the
language of reset words for a given automaton coincides with the language of
reset words for some particular automaton.Comment: 12 pages, 4 figure