Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!satisfied.elf.com!news.mathworks.com!uunet!in1.uu.net!allegra!alice!pereira
From: pereira@radish.research.att.com (Fernando Pereira)
Subject: Re: code for finite automata
In-Reply-To: mark@omnifest.uwm.edu's message of 13 Feb 1995 00:41:10 -0600
X-Nntp-Posting-Host: radish.research.att.com
Message-ID: <PEREIRA.95Feb13182916@radish.research.att.com>
Sender: usenet@research.att.com (netnews <9149-80593> 0112740)
Reply-To: pereira@research.att.com
Organization: AT&T Bell Laboratories
References: <3hmuu6$kln@omnifest.uwm.edu>
Distribution: na
Date: Mon, 13 Feb 1995 23:29:16 GMT
Lines: 17

In article <3hmuu6$kln@omnifest.uwm.edu> mark@omnifest.uwm.edu (Mark Hopkins) writes:
   In actual fact, one can do quite effective work with automata (both finite and
   infinite) when they are properly represented, i.e. as systems of equations.
   [...]
Sure, I know of those techniques well. But can you point me to algorithms 
based on those representations competitive with the best achievable
with automata representations? I would be interested in seeing them,
especially for intersection and minimization.
--
Fernando Pereira
2B-441, AT&T Bell Laboratories
600 Mountain Ave, PO Box 636
Murray Hill, NJ 07974-0636
pereira@research.att.com
1-908-582-3980


