Reset Complexity of Ideal Languages Over a Binary Alphabet

被引：6
|
作者：
Maslennikova, Marina [1 ]
机构：
[1] Ural Fed Univ, Inst Nat Sci & Math, Ekaterinburg 620000, Russia
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2019年 / 30卷 / 6-7期
基金：
俄罗斯基础研究基金会;
关键词：
Ideal language; synchronizing automaton; reset word; reset complexity; state complexity; PSPACE-completeness; SYNCHRONIZING AUTOMATA;
D O I：
10.1142/S0129054119400343
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. We compare the reset complexity and the state complexity for languages related to slowly synchronizing automata.
引用
收藏
页码：1177 / 1196
页数：20
相关论文
共 50 条
12345