On the Synchronization of Planar Automata
Planar automata seems to be representative of the synchronizing behavior of deterministic finite state automata. We conjecture that Černy’s conjecture holds true, if and only if, it holds true for planar automata. We provide new (and old) evidence concerning the conjectured Č erny-universality of planar automata.
The second author would like to thank the support provided by Universidad Nacional de Colombia through the project Hermes 8943 (32083).