A note on a recent attempt to improve the Pin-Frankl boundArticle
Authors: François Gonze 1; Raphaël M. Jungers 1; Avraham N. Trahtman 2
NULL##NULL##NULL
François Gonze;Raphaël M. Jungers;Avraham N. Trahtman
- 1 Institute of Information and Communication Technologies, Electronics and Applied Mathematics
- 2 Department of Mathematics [Ramat Gan]
Automata, Logic and Semantics
[en]
We provide a counterexample to a lemma used in a recent tentative improvement of the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of the proof, and improve the bound.
Volume: Vol. 17 no. 1
Section: Automata, Logic and Semantics
Published on: April 27, 2015
Imported on: December 3, 2014
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Automata, Synchronization, Cerny’s conjecture