10 Mar 1999 00:31:12 -0500

Related articles |
---|

Compress the finite state machine felixmish@usa.net (Felix Mish) (1999-03-02) |

Re: Compress the finite state machine cfc@world.std.com (Chris F Clark) (1999-03-04) |

Re: Compress the finite state machine torbenm@diku.dk (Torben Mogensen) (1999-03-04) |

Re: Compress the finite state machine jes6@eecs.lehigh.edu (James E. Stine) (1999-03-04) |

Re: Compress the finite state machine allanmac@blueprint.com (Allan MacKinnon) (1999-03-04) |

Re: Compress the finite state machine hunk@alpha1.csd.uwm.edu (1999-03-04) |

Re: Compress the finite state machine stans@lucent.com (Sicco Tans) (1999-03-10) |

Re: Compress the finite state machine torbenm@diku.dk (Torben Mogensen) (1999-03-22) |

Re: Compress the finite state machine sassth@unx.sas.com (Steven Hand) (1999-03-22) |

From: | Sicco Tans <stans@lucent.com> |

Newsgroups: | comp.compilers |

Date: | 10 Mar 1999 00:31:12 -0500 |

Organization: | Lucent Technologies , Merrimack Valley |

References: | 99-03-010 99-03-017 |

Keywords: | DFA |

*> [ to compress a DFA ]*

*> The first step is, obviously, to minimize the number of states in the*

*> DFA. You can find a method for this in Aho, Sethi and Ullman's*

*> compiler book, though the version described there isn't particularly*

*> efficient.*

Does anyone have a more efficient way to minimize the number of states in the

DFA?

Thanks!

-Sicco Tans

stans@lucent.com

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.