Re: infinite state machines

"Quinn Tyler Jackson" <qjackson@wave.home.com>
21 Oct 1999 22:02:41 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: "Quinn Tyler Jackson" <qjackson@wave.home.com>
Newsgroups: comp.compilers
Date: 21 Oct 1999 22:02:41 -0400
Organization: Compilers Central
References: 99-10-104
Keywords: DFA
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300

> 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?


I suggest the following papers:


Pierre Boullier, "Dynamic grammars and semantic analysis"


        ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-2322.pdf


John M. Shutt's three papers on SMFAs, at:


        http://www.cs.wpi.edu/~jshutt/smfa.html


WPI-CS-TR-95-4 Self-Modifying Finite Automata -- Power and Limitations. J.
Shutt. December 1995.


WPI-CS-TR-95-2 Self-Modifying Finite Automata -- Basic Definitions and
Results. J. Shutt and R. Rubinstein. August 1995.


WPI-CS-TR-93-11 Self-Modifying Finite Automata. J. Shutt and R. Rubinstein.
December 1993.


--
Quinn Tyler Jackson
http://www.qtj.net/~quinn/

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.