2 citations · 2 across the 4 of their papers we have counts for
4 papers
On Completely Reachable Automata and Subset Reachability
François Gonze, Raphaël M. Jungers
This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. T…
On the interplay between Babai and Cerny's conjectures
François Gonze, Vladimir Gusev, Balázs Gerencsér +2
Motivated by the Babai conjecture and the Cerny conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the…
A Note on a Recent Attempt to Improve the Pin-Frankl Bound
François Gonze, Raphaël M. Jungers, A. N. Trahtman
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 a…
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
François Gonze, Raphaël M. Jungers
Cerny's conjecture is a longstanding open problem in automata theory. We study two different concepts, which allow to approach it from a new angle. The first one is the triple rend…