Re: finite state minimization proofs

Derk Gwen <>
23 Aug 2003 23:05:18 -0400

          From comp.compilers

Related articles
finite state minimization proofs (Ralph P. Boland) (2003-08-20)
Re: finite state minimization proofs (Derk Gwen) (2003-08-23)
| List of all articles for this month |

From: Derk Gwen <>
Newsgroups: comp.compilers
Date: 23 Aug 2003 23:05:18 -0400
Organization: Quick STOP Groceries
References: 03-08-064
Keywords: parse, theory
Posted-Date: 23 Aug 2003 23:05:18 EDT

"Ralph P. Boland" <> wrote:
# Where can I find the simplest proofs that
# the algorithms for finite state machine minimiztion
# are correct; i.e. that the machine constructed has
# the fewest number of states?

Aho and Ullman The Theory of Parsing, Translation, and Compiling Volume 1.

Chapter 2.2 and 2.3 cover regular sets including deterministic and minimal

Derk Gwen

Post a followup to this message

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