A Finite-state Automaton, or Finite-state Machine (FSA). In general,
it is a Nondeterministic Finite-state Automaton (NFA).
A Nondeterministic Finite-state Automaton is a tuple (The structure is designed to support different data types, even
though states are usually numbers and input tokens are characters.
Method Summary |
|
__init__ (self)
Create an empty FSA (∅, Λ, None , ∅,
∅): |
|
__call__ (self,
start,
token)
|
|
__delitem__ (self,
start_label_end)
|
|
__getitem__ (self,
start,
label)
|
|
__repr__(self)
|
|
__setitem__ (self,
start_label,
end)
|
|
add_state(self,
state)
|
|
add_transition (self,
start,
label,
end)
Defines a new association δ(start ,
label ) → end . |
|
determinized(self)
|
frozenset
|
epsilon_closure (self,
states)
Evaluates ε-closure(states ). |
|
get_final(self)
|
|
get_initial(self)
|
|
get_transitions (self,
start,
label)
Evaluate ... |
|
minimized(self)
|
|
next_states (self,
start,
token)
Evaluate δ(start , label ). |
|
parse(self,
tokens)
|
|
remove_state(self,
state)
|
|
remove_transitions(self,
start,
label,
end)
|
|
reversed(self)
|
|
set_final(self,
state)
|
|
set_initial(self,
state)
|
|
states (self)
Return S, the states of the FSA. |
|
transitions_from (self,
start)
Evaluate ... |
|
unset_final(self,
state)
|