Package tulip :: Package transys :: Module automata :: Class FiniteStateAutomaton

Class FiniteStateAutomaton

Set of sequences described with a graph and a condition.

It has:

states
states.initial
states.accepting (types have names, and classes)
alphabet = set of symbols that label edges.

Note

If all paths in the graph belong to the set you want to describe, then just use FiniteTransitionSystem.

To describe an input-output function (which is a set too), it is more convenient to use FiniteStateMachine.

Inherited from networkx.classes.graph.Graph: __contains__, __getitem__, __iter__, __len__, add_cycle, add_path, add_star, add_weighted_edges_from, adjacency_iter, adjacency_list, copy, degree, has_node, nbunch_iter, nodes, nodes_iter, nodes_with_selfloops, number_of_nodes, number_of_selfloops, order, size

Inherited from object: __delattr__, __format__, __getattribute__, __hash__, __new__, __reduce__, __reduce_ex__, __repr__, __setattr__, __sizeof__, __subclasshook__

Properties

accepting

Inherited from networkx.classes.graph.Graph: name

Inherited from object: __class__

Method Details

init(self, deterministic=False, accepting_states_type=None, atomic_proposition_based=True, symbolic=False)
(Constructor)

Initialize FiniteStateAutomaton.

Additional keyword arguments are passed to LabeledDiGraph.__init__.

Parameters:

atomic_proposition_based - If False, then the alphabet is represented by a set. If True, then the alphabet is represented by a powerset 2^AP.

Overrides: object.__init__

str(self)
(Informal representation operator)

Return the graph name.

Returns
-------
name : string
    The name of the graph.

Examples
--------
>>> G = nx.Graph(name='foo')
>>> str(G)
'foo'

Overrides: object.__str__: (inherited documentation)

remove_node(self, node)

Remove state (also referred to as "node").

More than a wrapper since the state is also removed from the accepting set if present.

Overrides: networkx.classes.graph.Graph.remove_node

Property Details

accepting

Get Method:: unreachable.accepting(self)

Class FiniteStateAutomaton

Note

See Also

__init__(self, deterministic=False, accepting_states_type=None, atomic_proposition_based=True, symbolic=False) (Constructor)

__str__(self) (Informal representation operator)

remove_node(self, node)

accepting

init(self, deterministic=False, accepting_states_type=None, atomic_proposition_based=True, symbolic=False)
(Constructor)

str(self)
(Informal representation operator)