A Note on a Recent Attempt to Improve the Pin-Frankl Bound
classification
💻 cs.FL
keywords
boundimprovepin-franklrecentanswerattemptautomatacounterexample
read the original abstract
We provide a counterexample to a lemma used in a recent tentative improvement of the the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of proof, and improve the bound.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.