|infinite state machines email@example.com (1999-10-21)|
|Re: infinite state machines firstname.lastname@example.org (J. Florio) (1999-10-21)|
|Re: infinite state machines email@example.com (Quinn Tyler Jackson) (1999-10-21)|
|Re: infinite state machines firstname.lastname@example.org (1999-10-27)|
|Re: infinite state machines email@example.com (Christian Stapfer) (1999-10-27)|
|Re: infinite state machines firstname.lastname@example.org (1999-10-27)|
|Re: infinite state machines email@example.com (1999-10-28)|
|From:||"J. Florio" <firstname.lastname@example.org>|
|Date:||21 Oct 1999 22:02:21 -0400|
Just speculating: "Finite" meaning there are a finite number of states
that the machine can take. In compiler construction FSM's have
application in syntax (and some cases) semantic analysis of the input
statements (at least as I recall, it's one of the major applications).
Various data structures make it easy to automate generation of part of
the compiler through the application of FSM's. That gets a little
messy if you have an infinite number of states that you're trying to
represent in a machine that has a finite amount of storage. 8-)
- Jack Florio
> If we have finite state machines, is it possible to have 'infinite'
> state machines. Does anybody know of any web site or book or paper
> which explains something about this? I tried searching in Altavista
> but got very little. One web site just mentioned that 'infinite state
> machines are conceivable but not practical'. Can somebody explain?
Return to the
Search the comp.compilers archives again.