Home | Trees | Indices | Help |
|
---|
|
object --+ | dict --+ | FiniteAutomaton
Represent a finite automaton.
The FiniteAutomaton instance is a map from states to sets of transitions.
A transition is a map from a key to a set of states.
States are integers. The start and end state are distinguished. Transitions are by value, and are one of ElementDeclaration, ModelGroup[all], and Wildcard. The value None represents an epsilon transition.
|
|||
new empty dictionary |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
__stateID = -1
|
|||
__start = None
|
|||
__end = None
|
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
Create a new node in the automaton. No transitions are added. |
Copy the given automaton into this one. Returns a pair of the start and end states of the copied sub-automaton. |
Build a deterministic finite automaton that accepts the same language as this one. The resulting automaton has epsilon transitions only from terminal states to the DFA distinguished end state. |
str(x)
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Jan 28 08:39:51 2010 | http://epydoc.sourceforge.net |