automata to regexp

Ranjit Jhala <>
30 May 1998 11:44:48 -0400

          From comp.compilers

Related articles
automata to regexp (Ranjit Jhala) (1998-05-30)
Re: automata to regexp (Janaki S) (1998-06-03)
Re: automata to regexp (Janaki S) (1998-06-09)
| List of all articles for this month |

From: Ranjit Jhala <>
Newsgroups: comp.compilers
Date: 30 May 1998 11:44:48 -0400
Organization: IRISA, Campus de Beaulieu, 35042 Rennes Cedex, FRANCE
Keywords: DFA, question

Can someone please tell me what the fastest algorithms to
convert a DFA / NFA to a regular expression are . I know about the
algorithms in Hopcroft-Ullman etc. I was wondering if there is
anything faster.
Ranjit Jhala.

Post a followup to this message

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