symbolic_dynamics.sofic.find_separating_word¶

symbolic_dynamics.sofic.
find_separating_word
(G, H)[source]¶ Search for a separting word between G and H.
A separating word between G and H is a word w such that
len(idot(G, G, w)) > 0
andlen(idot(H, H, w)) == 0
.If G is irreducible, then return value is not None iff there is a separating word between G and H.
Otherwise, the return value being None does not imply there is no separating word between G and H.
 Parameters
 G, Hdeterministic labeled graphs
 Returns
 word or None
a separating word between G and H, None if search was unsuccessful