automata package

Submodules

automata.deterministic_finite_automaton module

class automata.deterministic_finite_automaton.DeterministicFiniteAutomaton(alphabet: base_types.alphabet.Alphabet, initial_state: base_types.state.State, states: set, comparator: abstract.finite_automata_comparator.FiniteAutomataComparator, name: Optional[str] = None, exportingStrategies: list = [<model_exporters.encoded_file_exporting_strategy.EncodedFileExportingStrategy object>], hole: base_types.state.State = Hole (Non-final))

Bases: abstract.finite_automaton.FiniteAutomaton

Implementation of DFA.

states

Set containing the DFA’s states

Type

set[State]

initial_state

Initial state of the DFA. Also included in “states”

Type

State

accepts(sequence: base_types.sequence.Sequence) → bool

automata.non_deterministic_finite_automaton module

class automata.non_deterministic_finite_automaton.ExecutionState(state, sequence)

Bases: tuple

sequence

Alias for field number 1

state

Alias for field number 0

class automata.non_deterministic_finite_automaton.NondeterministicFiniteAutomaton(alphabet: base_types.alphabet.Alphabet, initial_states: frozenset, states: set, comparator: abstract.finite_automata_comparator.FiniteAutomataComparator, name: Optional[str] = None, exportingStrategies: list = [<model_exporters.encoded_file_exporting_strategy.EncodedFileExportingStrategy object>], hole: base_types.state.State = Hole (Non-final))

Bases: abstract.finite_automaton.FiniteAutomaton

Implementation of NFA.

states

Set containing the DFA’s states

Type

set[State]

initial_states

Set containing all initial states of the NFA. Also included in “states”

Type

frozenset[State]

accepts(sequence: base_types.sequence.Sequence) → bool