4 Mar 1999 12:17:22 -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: | hunk@alpha1.csd.uwm.edu (Mark William Hopkins) |

Newsgroups: | comp.compilers |

Date: | 4 Mar 1999 12:17:22 -0500 |

Organization: | University of Wisconsin - Milwaukee, Computing Services Division |

References: | 99-03-010 |

Keywords: | DFA |

*>I am evaluating the ways to compress the finite state machine.*

*>Is there anyone be kind enough to provide some possible solutions?*

(A) A minimal list of substrings which are never processed by the automaton.

To make this work, I think you'll also need to add an extra marker symbol

# and regard every word W as being of the form #W#.

Example:

The two-state automaton [0] - a -> [1] - b -> [0] (0 = start state, 1 =

final state) has the list:

##, #b, a#, aa, bb

(B) A minimal list of words marked with an indication of whether they are

accepted by the automaton or not.

If there's supposed to be output as well, I'm not which of (A) or (B)

apply.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.