ON A CONJECTURE BY CARPI AND D'ALESSANDRO-Reference-Cited by-同舟云学术

ON A CONJECTURE BY CARPI AND D'ALESSANDRO

Published:2011-11 Issue:07 Volume:22 Page:1565-1576
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

BERLINKOV MIKHAIL V.¹

Affiliation:

1. Department of Algebra and Discrete Mathematics, Faculty of Mathematics and Mechanics, Ural State University Ekaterinburg, Lenina 51, 620083, Russia

Abstract

Recently, Carpi and D'Alessandro have formulated a conjecture whose validity would imply an O(n2) upper bound for the minimum length of reset for synchronizing automata with n states. We refute this conjecture as well as a related conjecture by Rystsov and suggest a weaker version that still suffices to achieve a quadratic upper bound.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S012905411100888X

Reference19 articles.

1. A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA

2. A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata

3. The Synchronization Problem for Strongly Transitive Automata

4. Strongly transitive automata and the Černý conjecture

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Синхронизация конечных автоматов;Uspekhi Matematicheskikh Nauk;2022

2. Synchronization of finite automata;Russian Mathematical Surveys;2022

3. On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata;SIAM Journal on Discrete Mathematics;2016-01

4. Synchronizing Automata with Extremal Properties;Mathematical Foundations of Computer Science 2015;2015

5. SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA;International Journal of Foundations of Computer Science;2013-09