|working with very large Finite State Machines firstname.lastname@example.org (Steve Bradtke) (2001-04-22)|
|Re: working with very large Finite State Machines email@example.com (2001-04-26)|
|Re: working with very large Finite State Machines firstname.lastname@example.org (David Chase) (2001-04-26)|
|Re: working with very large Finite State Machines email@example.com (Ralph Boland) (2001-04-26)|
|Re: working with very large Finite State Machines firstname.lastname@example.org (Rodney M. Bates) (2001-04-29)|
|From:||David Chase <email@example.com>|
|Date:||26 Apr 2001 21:08:07 -0400|
|Posted-Date:||26 Apr 2001 21:08:07 EDT|
Steve Bradtke wrote:
> I am working on a project that involves the construction of
> very large Finite State Machines (up to approximately 10^7 states).
I don't have the pointers that you need, but where do those gigantic
FSMs come from? Sometimes, you can do a little upstream processing to
reduce the downstream complexity. I wrote on paper on this in 1987 for
tree-pattern-matching FSMs -- it is of no help to you, but it's an
example of this sort of approach, and the savings were pretty good.
Return to the
Search the comp.compilers archives again.