• DOI:10.4204/EPTCS.3.4
Corpus ID: 9014414

Testing the Equivalence of Regular Languages

@inproceedings{Almeida2009TestingTE,
  title={Testing the Equivalence of Regular Languages},
  author={M. Almeida and Nelma Moreira and Rog{\'e}rio Reis},
  booktitle={DCFS},
  year={2009}
}

• M. Almeida, Nelma Moreira, Rogério Reis
• Published in DCFS 2009
• Computer Science, Mathematics

The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp pro- posed an almost linear algorithm for testing the equivalence of two de- terministic finite automata that avoids minimisation. In this paper we improve the best-case running time, present an extension of this algo- rithm to non… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed