Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uwm.edu!spool.mu.edu!uunet!mnemosyne.cs.du.edu!cag
From: cag@mnemosyne.cs.du.edu (Chris Gantz)
Newsgroups: comp.theory
Subject: Re: NFA, DFA manipulation Source Code
Message-ID: <1991Feb6.170754.3276@mnemosyne.cs.du.edu>
Date: 6 Feb 91 17:07:54 GMT
References: <1991Feb5.192015.8503@uwovax.uwo.ca>
Reply-To: cag@mnemosyne.UUCP (Chris Gantz)
Organization: Math/CS, University of Denver
Lines: 33

In article <1991Feb5.192015.8503@uwovax.uwo.ca> 4203_5114@uwovax.uwo.ca writes:
>Hi.  I'm looking for source code to do the following:
>
>Given a DFA as input, will return a equivalent complete DFA as output.
>
>and ..
>
>Given an NFA as input, return the NFA after all unreachable and useless
>states have been removed.
>
>Any HLL language would be helpful, (ie pascal, c, etc), But I would prefer
>code in LISP, PROLOG or MIRANDA.
>
>Thanks in Advance,
>Bill McLean
>
>sa_bill@vaxi.sscl.uwo.ca
>mclean@obelix.gaul.uwo.ca


Could I also receive any available information regarding this subject matter
as well.

-Chris

Chris Gantz				Uucp:     diana!cgantz
University of Denver			Internet: cgantz@diana.cair.du.edu
Denver, CO 80208			Grad. Student

-- 
Chris Gantz				Uucp:     diana!cgantz
University of Denver			Internet: cgantz@diana.cair.du.edu
Denver, CO 80208			Grad. Student