An Extremal Series of Eulerian Synchronizing Automata

被引：2
|
作者：
Szykula, Marek [1 ]
Vorel, Vojtech [2 ]
机构：
[1] Univ Wroclaw, Inst Comp Sci, Joliot Curie 15, Wroclaw, Poland
[2] Charles Univ Prague, Fac Math & Phys, Malostranske Nam 25, Prague, Czech Republic
来源：
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016 | 2016年 / 9840卷
关键词：
Eulerian automaton; Reset threshold; Reset word; Synchronizing automaton; CERNY CONJECTURE; RESET WORDS; LENGTH;
D O I：
10.1007/978-3-662-53132-7_31
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present an infinite series of n-state Eulerian automata whose reset words have length at least (n(2) - 3)/2. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that (n(2) - 3)/2 also forms an upper bound for this class and we experimentally verify it for small automata by an exhaustive computation.
引用
收藏
页码：380 / 392
页数：13
相关论文
共 50 条
  • [1] Synchronizing Automata with Extremal Properties
    Kisielewicz, Andrzej
    Szykula, Marek
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 331 - 343
  • [2] Extremal synchronizing circular automata
    He, Yong
    Chen, Xueping
    Li, Gang
    Sun, Shiyuan
    INFORMATION AND COMPUTATION, 2021, 281
  • [3] Synchronizing finite automata on Eulerian digraphs
    Kari, J
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 432 - 438
  • [4] Synchronizing finite automata on Eulerian digraphs
    Kari, J
    THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 223 - 232
  • [5] SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA
    Berlinkov, Mikhail V.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (06) : 729 - 745
  • [6] Synchronizing monotonic automata
    Ananichev, DS
    Volkov, MV
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2003, 2710 : 111 - 121
  • [7] ON SYNCHRONIZING UNAMBIGUOUS AUTOMATA
    CARPI, A
    THEORETICAL COMPUTER SCIENCE, 1988, 60 (03) : 285 - 296
  • [8] Synchronizing monotonic automata
    Ananichev, DS
    Volkov, MV
    THEORETICAL COMPUTER SCIENCE, 2004, 327 (03) : 225 - 239
  • [9] A series of slowly synchronizing automata with a zero state over a small alphabet
    Martugin, P. V.
    INFORMATION AND COMPUTATION, 2008, 206 (9-10) : 1197 - 1203
  • [10] Experiments with Synchronizing Automata
    Kisielewicz, Andrzej
    Kowalski, Jakub
    Szykula, Marek
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 176 - 188
12345