Path: utzoo!utgpu!watserv1!ria!uwovax.uwo.ca!4203_5114
From: 4203_5114@uwovax.uwo.ca
Newsgroups: comp.theory
Subject: NFA, DFA manipulation Source Code
Message-ID: <1991Feb5.192015.8503@uwovax.uwo.ca>
Date: 6 Feb 91 00:20:14 GMT
Lines: 17

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