symbolic_dynamics.sofic.find_synchronizing_word¶
-
symbolic_dynamics.sofic.find_synchronizing_word(G)[source]¶ Search for a synchronizing word in G.
A synchronizing word in G is a word w such that
len(idot(G, G, w)) == 1.If G is follower-separated, a synchronizing word always exists and one is always returned.
If G is irreducible or fully deterministic, then the return value is not None iff there is a synchronizing word.
Otherwise, the return value being None does not imply no synchronizing word exists in G.
- Parameters
- Gdeterminstic labeled graph
- Returns
- word or None
a synchronizing word in G, None if search was unsuccessful
See also