Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Maslennikova, Marina I."'
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
Externí odkaz:
http://arxiv.org/abs/1305.0336
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 calcu
Externí odkaz:
http://arxiv.org/abs/1304.3307
Autor:
Gusev, Vladimir V.1 vl.gusev@gmail.com, Maslennikova, Marina I.1 maslennikova.marina@gmail.com, Pribavkina, Elena V.1 elena.pribavkina@usu.ru
Publikováno v:
Fundamenta Informaticae. 2014, Vol. 132 Issue 1, p95-108. 14p.
