A note on a recent attempt to improve the Pin-Frankl bound

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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science 2015-01, Vol.17 no. 1 (Automata, Logic and Semantics), p.307-308
Hauptverfasser:	Gonze, François, Jungers, Raphaël M., Trahtman, Avraham N.
Format:	Artikel
Sprache:	eng
Schlagworte:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] automata cerny’s conjecture Computer Science Discrete Mathematics synchronization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.2101