2 papers
cs.FL2018
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…
cs.FL2017
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…