Re: References to Finite Automata theory

Peter Ludemann <ludemann@inxight.com>
16 Oct 1997 00:25:22 -0400

          From comp.compilers

Related articles
References to Finite Automata theory mcr@visi.com (Michael) (1997-10-14)
Re: References to Finite Automata theory ludemann@inxight.com (Peter Ludemann) (1997-10-16)
| List of all articles for this month |

From: Peter Ludemann <ludemann@inxight.com>
Newsgroups: comp.compilers
Date: 16 Oct 1997 00:25:22 -0400
Organization: InXight Software, Inc. http://www.inxight.com
References: 97-10-068
Keywords: theory

The following URLs might be of use. The first three are more oriented
towards fast parsing of natural languages, but they'll work fine for
computer languages.


http://www.xerox.fr/research/mltt/fst/home.html
http://www.rxrc.xerox.com/research/mltt/fst/articles/jnle-97/rele.html
http://www.sil.org/pckimmo/about_pc-kimmo.html
http://www.let.rug.nl/~vannoord/FSA/fsa.html


A page of references to the finite-state literature is at:


http://www.xerox.fr/research/mltt/fst/fsrefs.html


Be warned that efficient finite-state machines are hard to produce (we
have proprietary technology which makes the transducers small enough
and fast enough to be useful; the optimizations allow lexicons with
millions of words to fit into 200K-300K and run at speeds competitive
with hash table lookup).


--
Peter Ludemann +1.650.813.6806 (fax: +1.650.813.7400)
Software Architect ludemann@inxight.com
Inxight Software, Inc. http://www.inxight.com
PAHV 118, 3400 Hillview Ave., Palo Alto, CA 94304
--


Post a followup to this message

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