Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| infinite state machines karthik@cdotd.ernet.in (1999-10-21) |
| Re: infinite state machines jfflorio@acm.org (J. Florio) (1999-10-21) |
| Re: infinite state machines qjackson@wave.home.com (Quinn Tyler Jackson) (1999-10-21) |
| Re: infinite state machines bourguet@my-deja.com (1999-10-27) |
| Re: infinite state machines chstapfer@bluewin.ch (Christian Stapfer) (1999-10-27) |
| Re: infinite state machines mac@coos.dartmouth.edu (1999-10-27) |
| Re: infinite state machines scorp@btinternet.com (1999-10-28) |
| From: | bourguet@my-deja.com |
| Newsgroups: | comp.compilers |
| Date: | 27 Oct 1999 14:03:29 -0400 |
| Organization: | Deja.com - Before you buy. |
| References: | 99-10-104 |
| Keywords: | DFA |
> 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?
Well, a class of infinite state machine is stack automata like the
ones used to implement table driven LR or LL parser. The contains of
the stack is part of the state of the machine. I'd not call these kind
of machines not practical
-- Jean-Marc Bourguet
Return to the
comp.compilers page.
Search the
comp.compilers archives again.