NFA -> Regexp mapping

Article View: comp.theory

Article #1937

#1937

From: Steven Bird
Date: Mon, 11 Jan 1993 12:55

9 lines
709 bytes

Does anyone know if there are any algorithms for converting an NFA
into a (preferrably compact) regular expression?  Please reply by mail
and I'll summarise to the net.

-- 
Steven Bird.            <Steven.Bird@edinburgh.ac.uk>
University of Edinburgh, Centre for Cognitive Science
2 Buccleuch Place, Edinburgh  EH8 9LW, Scotland, U.K.
Telephone: (031) 650-4421/4432.  Fax: (031) 650-4587.

Technical Details

Message-ID: <12305@mcgonagall.ed.ac.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!pipex!bnr.co.uk!uknet!edcastle!edcogsci!steven

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!pipex!bnr.co.uk!uknet!edcastle!edcogsci!steven
From: steven@cogsci.ed.ac.uk (Steven Bird)
Newsgroups: comp.theory
Subject: NFA -> Regexp mapping
Message-ID: <12305@mcgonagall.ed.ac.uk>
Date: 11 Jan 93 12:55:51 GMT
Organization: Centre for Cognitive Science, Edinburgh, UK
Lines: 9