Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 307-308 |
Number of pages | 2 |
Journal | Discrete Mathematics and Theoretical Computer Science |
Volume | 17 |
Issue number | 1 |
State | Published - 2015 |
Bibliographical note
Publisher Copyright:© 2015 Discrete Mathematics and Theoretical Computer Science (DMTCS).
Keywords
- Automata
- Synchronization
- Černý's conjecture