A Note on a Recent Attempt to Improve the Pin-Frankl Bound
Formal Languages and Automata Theory
2014-12-03 v1
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.
Keywords
Cite
@article{arxiv.1412.0975,
title = {A Note on a Recent Attempt to Improve the Pin-Frankl Bound},
author = {François Gonze and Raphaël M. Jungers and A. N. Trahtman},
journal= {arXiv preprint arXiv:1412.0975},
year = {2014}
}
Comments
Short note presenting a counterexample and the resulting open question