symbolic_dynamics.sofic.random_deterministic_graph_with_props

symbolic_dynamics.sofic.random_deterministic_graph_with_props(n, m, props)

Randomly generates a deterministic graph defined by m partial functions over n states that satisfies each each predicate in props.

Parameters

nint

domain/codomain of partial functions

mint

number of partial functions

propslist of predicates

the predicates for the random graph to satisfy

Examples

>>> is_reducible = lambda G: not sd.is_irreducible(G)
>>> props = [sd.is_essential, is_reducible]
>>> G = sd.random_deterministic_graph_with_props(5, 2, props)
>>> sd.is_essential(G)
True
>>> sd.is_irreducible(G)
False