Principal ideal languages and synchronizing automata
Formal Languages and Automata Theory
2013-04-12 v1
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.
Cite
@article{arxiv.1304.3307,
title = {Principal ideal languages and synchronizing automata},
author = {Vladimir V. Gusev and Marina I. Maslennikova and Elena V. Pribavkina},
journal= {arXiv preprint arXiv:1304.3307},
year = {2013}
}
Comments
15 pages, 9 figures