Principal Ideal Languages and Synchronizing Automata

被引:4
|
作者
Gusev, Vladimir V. [1 ]
Maslennikova, Marina I. [1 ]
Pribavkina, Elena V. [1 ]
机构
[1] Ural Fed Univ, Inst Math & Comp Sci, Ekaterinburg 620083, Russia
基金
俄罗斯基础研究基金会;
关键词
ideal language; synchronizing automaton; synchronizing word; strongly connected automaton; syntactic complexity;
D O I
10.3233/FI-2014-1034
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:95 / 108
页数:14
相关论文
共 50 条