![]() |
Discrete Mathematics & Theoretical Computer Science |
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.
Source : ScholeXplorer
IsRelatedTo ARXIV 1410.4034 Source : ScholeXplorer IsRelatedTo DOI 10.1137/15m1024603 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1410.4034
|