Minimal DFA properties

"Paul J. Lucas" <pjl.removethis@removethistoo.mac.com>
24 Mar 2002 11:08:16 -0500

          From comp.compilers
Related articles
Minimal DFA properties pjl.removethis@removethistoo.mac.com (Paul J. Lucas) (2002-03-24)
Re: Minimal DFA properties daw@mozart.cs.berkeley.edu (2002-03-24)
Re: Minimal DFA properties thp@cs.ucr.edu (2002-03-31)
| List of all articles for this month |
From: "Paul J. Lucas" <pjl.removethis@removethistoo.mac.com>
Newsgroups: comp.compilers
Date: 24 Mar 2002 11:08:16 -0500
Organization: Prodigy Internet http://www.prodigy.com
Keywords: lex, theory, question
Posted-Date: 24 Mar 2002 11:08:16 EST

If one has two minimal DFAs representing regular languages and one
takes their union and intersection (separately), are the resulting
DFAs also minimal or do you you have to rerun a minimization algorithm
on the results to get minimal DFAs?


- Paul

Post a followup to this message

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