8 Sep 2006 00:27:04 -0400

Related articles |
---|

Algorithms for finding if two DFA's are equivalent Roger.Sindreu@gmail.com (2006-09-08) |

Re: Algorithms for finding if two DFA's are equivalent Szabolcs.Ivan@gmail.com (Szabolcs Ivan) (2006-09-08) |

Re: Algorithms for finding if two DFA's are equivalent torbenm@app-3.diku.dk (2006-09-08) |

Re: Algorithms for finding if two DFA's are equivalent sasha.mal@excite.com (sasha mal) (2006-09-08) |

Re: Algorithms for finding if two DFA's are equivalent rpboland@gmail.com (2006-09-08) |

From: | Roger.Sindreu@gmail.com |

Newsgroups: | comp.compilers,comp.theory |

Date: | 8 Sep 2006 00:27:04 -0400 |

Organization: | http://groups.google.com |

Keywords: | lex, question |

Posted-Date: | 08 Sep 2006 00:27:04 EDT |

Hi,

I would like to know all the methods you know for finding if two DFA's

are equivalent.

I know the trivial algorithm which is finding the mininimum DFA for

each DFA, and just check if they are equal. Do you know any other

algorithm? Do not care much about its cost, this is not a goal for me.

If possible, please give references.

Cheers,

Roger Sindreu.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.