Principal ideal languages and synchronizing automata
arXiv:1304.3307
Abstract
We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.
15 pages, 9 figures