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 条
  • [1] Reset Complexity of Ideal Languages Over a Binary Alphabet
    Maslennikova, Marina
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 262 - 273
  • [2] State complexity of permutation on finite languages over a binary alphabet
    Cho, Da-Jung
    Goc, Daniel
    Han, Yo-Sub
    Ko, Sang-Ki
    Palioudakis, Alexandros
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2017, 682 : 67 - 78
  • [3] On slender 0L languages over the binary alphabet
    Honkala, J
    ACTA INFORMATICA, 2000, 36 (9-10) : 805 - 815
  • [4] On slender 0L languages over the binary alphabet
    Juha Honkala
    Acta Informatica, 2000, 36 : 805 - 815
  • [5] Quotient complexity of ideal languages
    Brzozowski, Janusz
    Jiraskova, Galina
    Li, Baiyu
    THEORETICAL COMPUTER SCIENCE, 2013, 470 : 36 - 52
  • [6] Quotient Complexity of Ideal Languages
    Brzozowski, Janusz
    Jiraskova, Galina
    Li, Baiyu
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 208 - +
  • [7] ON THE REGULARITY OF LANGUAGES ON A BINARY ALPHABET GENERATED BY COPYING SYSTEMS
    BOVET, DP
    VARRICCHIO, S
    INFORMATION PROCESSING LETTERS, 1992, 44 (03) : 119 - 123
  • [8] Languages over an alphabet interpreted in a Boolean algebra
    Surzhko, SV
    Yushchenko, EL
    CYBERNETICS AND SYSTEMS ANALYSIS, 1995, 31 (03) : 388 - 400
  • [9] Investigations on Automata and Languages Over a Unary Alphabet
    Pighizzini, Giovanni
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (07) : 827 - 850
  • [10] Investigations on Automata and Languages over a Unary Alphabet
    Pighizzini, Giovanni
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014, 2014, 8587 : 42 - 57
12345