Sciweavers

JUCS
2002
123views more  JUCS 2002»
13 years 11 months ago
Synchronization and Stability of Finite Automata
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
Jarkko Kari