Finitely generated ideal languages and synchronizing automata
arXiv:1305.0336
Abstract
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.
Submitted to WORDS 2013