Trees | Index | Help |
|
---|
Package pylilac :: Module DelegateFSA :: Class DelegateFSA |
|
FiniteStateAutomaton
--+
|
DelegateFSA
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 (S, Λ, s, F, δ) whereThe structure is designed to support different data types, even though states are usually numbers and input tokens are characters.
In basic operations S and Λ must support equivalence and hashing.
For determinization, S must support comparability.
For recognition, Λ must also support callability.Method Summary | |
---|---|
Inherited from FiniteStateAutomaton | |
Create an empty FSA (∅, Λ, None , ∅,
∅): | |
| |
| |
| |
| |
| |
| |
Defines a new association δ( start ,
label ) → end . | |
| |
frozenset |
Evaluates ε-closure( states ). |
| |
| |
Evaluate ... | |
| |
Evaluate δ( start , label ). | |
| |
| |
| |
| |
| |
| |
Return S, the states of the FSA. | |
Evaluate ... | |
|
Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Sat Aug 26 09:33:46 2006 | http://epydoc.sf.net |