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 条
  • [41] EXACT APPROXIMATION OF AVERAGE SUBWORD COMPLEXITY OF FINITE RANDOM WORDS OVER FINITE ALPHABET
    Ivanko, E. E.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2008, 14 (04): : 185 - 189
  • [42] On the complexity of binary polynomial optimization over acyclic hypergraphs
    Del Pia, Alberto
    Di Gregorio, Silvia
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2684 - 2699
  • [43] On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
    Del Pia, Alberto
    Di Gregorio, Silvia
    ALGORITHMICA, 2023, 85 (08) : 2189 - 2213
  • [44] State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages
    Okhotin, Alexander
    Sazhneva, Elizaveta
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020, 2020, 12442 : 142 - 154
  • [45] GENERATION OF BINARY SEQUENCES WITH CONTROLLABLE COMPLEXITY AND IDEAL-R-TUPEL DISTRIBUTION
    SIEGENTHALER, T
    KLEINER, AW
    FORRE, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 304 : 15 - 23
  • [46] Commutative Finite State Automaton Group (FSAG) Having Cycles over the Binary Alphabet
    Bharathi, S. Jeya
    Jeyanthi, A.
    2014 INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE ISCMI 2014, 2014, : 106 - 109
  • [47] Adaptations of the Latin alphabet to write fragmentary languages
    Cornago, Ignacio Simon
    PALAEOHISPANICA-REVISTA SOBRE LENGUAS Y CULTURAS DE LA HISPANIA ANTIGUA, 2020, (20): : 1067 - 1101
  • [48] Phonetic String Matching for Languages with Cyrillic Alphabet
    Paramonov, Viacheslav
    Shigarov, Alexey
    Ruzhnikov, Gennady
    Cherkashin, Evgeny
    INFORMATION SYSTEMS ARCHITECTURE AND TECHNOLOGY, ISAT 2018, PT I, 2019, 852 : 301 - 311
  • [49] STEWING OVER THE ALPHABET
    GILL, KJ
    QUALITY PROGRESS, 1985, 18 (01) : 7 - 7
  • [50] ALPHABET COMPLEXITY AND LETTER IDENTIFICATION EFFICIENCY
    BURNS, CW
    FARELL, B
    MOORE, DM
    PELLI, DG
    INVESTIGATIVE OPHTHALMOLOGY & VISUAL SCIENCE, 1995, 36 (04) : S907 - S907
12345