Prefer a chat interface with context about you and your work?
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
The Černý conjecture is a longstanding open problem in automata theory. We study two different concepts, which allow us to approach it from a new angle. The first one is the triple rendezvous time, i.e., the length of the shortest word mapping three states onto a single one. The second …