Re: Regular Expression -> NFA -> Minimal DFA

Robert Zierer <rz1@stud.mw.tu-muenchen.de>
16 Feb 2002 01:17:08 -0500

          From comp.compilers
Related articles
Regular Expression -> NFA -> Minimal DFA rmgarnet@artsci.wustl.edu (Roman Garnett) (2002-02-06)
Re: Regular Expression -> NFA -> Minimal DFA neelk@alum.mit.edu (2002-02-16)
Re: Regular Expression -> NFA -> Minimal DFA rz1@stud.mw.tu-muenchen.de (Robert Zierer) (2002-02-16)
| List of all articles for this month |
From: Robert Zierer <rz1@stud.mw.tu-muenchen.de>
Newsgroups: comp.compilers
Date: 16 Feb 2002 01:17:08 -0500
Organization: [posted via] Leibniz-Rechenzentrum, Muenchen (Germany)
References: 02-02-027
Keywords: lex
Posted-Date: 16 Feb 2002 01:17:08 EST

Roman Garnett wrote:
> I'm working on a project for my finite automata class, and I'm in
> need of a program to take a regular expression as input, and return an
> NFA accepting the corresponding language, and the minimal DFA
> accepting the language. We're studying the relationship between the
> number of states in the two automata. The only utility I've found
> stresses a graphical interface that is not important to me. Can
> anyone lead me in the right direction?
>
> Thanks,
> Roman Garnett
> [You might be able to extract that from flex. -John]


There are also some sources at


<URL: ftp://iecc.com/pub/file/regex.tar.gz >


See also comp.compilers article
  Subject: Need regexp source
  Message-ID: 00-01-006
with responses.


--
Robert Zierer

Post a followup to this message

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