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 条

[31] Infinite Synchronizing Words for Probabilistic Automata
Doyen, Laurent
Massart, Thierry
Shirmohammadi, Mahsa
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 278 - 289
[32] Synchronizing Automata over Nested Words
Chistikov, Dmitry
Martyugin, Pavel
Shirmohammadi, Mahsa
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2016), 2016, 9634 : 252 - 268
[33] Short Synchronizing Words for Random Automata
Chapuy, Guillaume
Perarnau, Guillem
PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 581 - 604
[34] Synchronizing Data Words for Register Automata
Quaas, Karin
Shirmohammadi, Mahsa
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2019, 20 (02)
[35] On the synchronizing mechanism of a class of cellular automata
Satulovsky, JE
PHYSICA A, 1997, 237 (1-2): : 52 - 58
[36] Synchronizing billion-scale automata
Tas, Mustafa Kemal
Kaya, Kamer
Yenigun, Husnu
INFORMATION SCIENCES, 2021, 574 : 162 - 175
[37] CONTROL OF AUTOMATA THAT HAVE A SYNCHRONIZING SEQUENCE
SPERANSKIY, DV
ENGINEERING CYBERNETICS, 1971, 9 (01): : 74 - +
[38] Synchronizing automata with a letter of deficiency 2
Ananichev, D. S.
Volkov, M. V.
Zaks, Yu. I.
THEORETICAL COMPUTER SCIENCE, 2007, 376 (1-2) : 30 - 41
[39] Synchronizing Almost-Group Automata
Berlinkov, Mikhail V.
Nicaud, Cyril
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (08) : 1091 - 1112
[40] On an optimal synchronizing experiment with linear automata
Bogomolov, A.S.
Speranskii, D.V.
2002, IAPC Nauka/Interperiodica (41)

← 1 2 3 4 5 →