Some new Features of Row Monomial Matrices for the Study of DFA
The work presents some new results and ideas concerning the synchronization of automata. 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
Read More