Sciweavers

CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 11 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
STRINGOLOGY
2008
14 years 26 days ago
The Road Coloring and Cerny Conjecture
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
Avraham Trahtman
TAMC
2007
Springer
14 years 5 months ago
Synchronization of Some DFA
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
A. N. Trahtman