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}
}
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
15 Citations
Deciding Regular Expressions (In-)Equivalence in Coq
  • 14
  • PDF
Formalization of closure properties for context-free grammars
  • 8
  • PDF
Formalization of simplification for context-free grammars
  • 7
  • PDF
On the semantics of regular expression parsing in the wild
  • 8
  • Highly Influenced
  • PDF
Interface protocol inference to aid understanding legacy software components
  • 5
  • PDF
Towards a Theory of Special-Purpose Program Obfuscation
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 43 REFERENCES
Antimirov and Mosses's Rewrite System Revisited
  • 23
  • PDF
On the Representation of Finite Automata
  • 18
  • PDF
Automata and Computability
  • D. Kozen
  • Mathematics, Computer Science
  • Undergraduate Texts in Computer Science
  • 1997
  • 372
  • PDF
Enumeration and generation with a string automata representation
  • 55
  • PDF
Antimirov and Mosses's Rewrite System Revisited
  • 1
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
  • J. Rutten
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2003
  • 176
  • PDF
An Introduction to Automata Theory
  • 1,821
Partial Derivatives of Regular Expressions and Finite Automaton Constructions
  • 292
  • PDF
...
1
2
3
4
5
...