From: Dave Gomboc (dave_at_[hidden])
Date: 2005-03-10 11:49:01
> However, since each innermost state must know all its outer
> states (1),
> it is theoretically possible to collapse all the reactions of
> states into a STT that is local for each innermost state. At a
> hefty price, this would give you constant-time lookup,
> *separately* for
> each innermost state. In FSMs with orthogonal regions multiple
> innermost states can be active at the same time, which makes
> linear again. Hence my previous remark to Dave.
1. And a state-superset transition table is not possible for
compiler capability reasons?
2. You know, the NFA -> DFA conversion process is _exactly_ the
process that one would use to take the state-supersets and flatten
Win: constant-time dispatch.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk