Sciweavers

Share
JUCS
2002

Synchronization and Stability of Finite Automata

8 years 5 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 in such a way that each vertex has one edge of each color leaving it. The automaton is called synchronized if there exists an input word that maps all vertices into the same fixed vertex. The road coloring conjecture asks whether there always exists a coloring such that the resulting automaton is synchronized. The conjecture has been proved for various types of graphs but the general problem remains open. In this work we investigate a related concept of stability, using techniques of linear algebra. We have proved in our earlier papers that the road coloring conjecture is equivalent to the conjecture that each strongly connected and aperiodic graph has a coloring where at least one pair of states is stable. In the present work we prove that stable pairs of states exist in all automata that are almost balanced ...
Jarkko Kari
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where JUCS
Authors Jarkko Kari
Comments (0)
books