1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.FL2019
Matrix approach to synchronizing automata
A. N. Trahtman
A word of letters on edges of underlying graph of deterministic finite automaton (DFA) is called synchronizing if sends all states of the automaton to a unique state. J…
cs.DM2009★ 1 cited
The Road Coloring for Mapping on k States(withdrawn)
A. N. Trahtman
Let be directed strongly connected finite graph of uniform outdegree (constant outdegree of any vertex) and let some coloring of edges of turn the graph into deterministic…
cs.DM2007
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
A. N. Trahtman
A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Cerny had…