Given a list of state machines, make a new machine that will execute
the first until it is done, then execute the second, etc. Assume they
all have the same input space.
|
|
|
|
|
|
|
|
|
done(self,
state)
By default, machines don't terminate |
|
|
|
printDebugInfo(self,
depth,
state,
nextState,
inp,
out,
debugParams)
Default method for printing out all of the debugging information for
a primitive machine. |
|
|
Inherited from SM :
check ,
doTraceTasks ,
getStartState ,
guaranteeName ,
isDone ,
run ,
start ,
step ,
transduce ,
transduceF
|