A note on a recent attempt to improve the Pin-Frankl bound
François Gonze, Raphaël M. Jungers, A. N. Trahtman · Discrete Mathematics & Theoretical Computer Science · 2015
Automata, Logic and Semantics 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.