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 条

[21] SYNCHRONIZING SEQUENCES FOR PROBABILISTIC AUTOMATA
KFOURY, DJ
[J]. STUDIES IN APPLIED MATHEMATICS, 1970, 49 (01) : 101 - &
[22] On Synchronizing Automata and Uniform Distribution
Lerner, Emil
[J]. Implementation and Application of Automata, 2016, 9705 : 202 - 212
[23] Slowly Synchronizing Automata and Digraphs
Ananichev, Dmitry
Gusev, Vladimir
Volkov, Mikhail
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 55 - 65
[24] ON THE SYNCHRONIZING PROBABILITY FUNCTION AND THE TRIPLE RENDEZVOUS TIME FOR SYNCHRONIZING AUTOMATA
Gonze, Francois
Jungers, Raphael M.
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (02) : 995 - 1014
[25] On an optimal synchronizing experiment with linear automata
Bogomolov, AS
Speranskii, DV
[J]. JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2002, 41 (03) : 397 - 403
[26] Synchronizing automata with a letter of deficiency 2
Ananichev, D. S.
Volkov, M. V.
Zaks, Yu. I.
[J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 433 - 442
[27] Principal Ideal Languages and Synchronizing Automata
Gusev, Vladimir V.
Maslennikova, Marina I.
Pribavkina, Elena V.
[J]. FUNDAMENTA INFORMATICAE, 2014, 132 (01) : 95 - 108
[28] Lower bound for the length of synchronizing words in partially-synchronizing automata
Roman, Adam
Forys, Wit
[J]. SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 448 - 459
[29] Optimal Synchronizing Experiments with Linear Automata
A. S. Bogomolov
D. V. Speranskii
[J]. Automation and Remote Control, 2001, 62 : 1725 - 1730
[30] Infinite Synchronizing Words for Probabilistic Automata
Doyen, Laurent
Massart, Thierry
Shirmohammadi, Mahsa
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 278 - 289

← 1 2 3 4 5 →