symbolic_dynamics.sofic.is_synchronizing

symbolic_dynamics.sofic.is_synchronizing(G)

Returns True iff G is synchronizing.

A deterministic graph G is synchronizing if for each vertex q in G there is a word w such that idot(G, G, w) == iset([q]).

Parameters

Gdeterministic labeled graph

Examples

>>> G = nx.MultiDiGraph()
>>> G.add_edge(1, 1, label="a")
>>> G.add_edge(1, 2, label="b")
>>> G.add_edge(2, 2, label="a")
>>> sd.is_synchronizing(G)
False
>>> G.add_edge(1, 1, label="c")
>>> sd.is_synchronizing(G)
True