8 citations · 28 across the 17 of their papers we have counts for
1 paper · 1 filter
A. N. Trahtman
A word w of letters on edges of underlying graph Γ of deterministic finite automaton (DFA) is called synchronizing if w sends all states of the automaton to a unique state. J…