Reducing NFAs by invariant equivalences☆
Under an Elsevier user license
open archive
Keywords
Non-deterministic finite automata
Regular expressions
Automata minimization
Invariant equivalences
Derivatives of regular expressions
Cited by (0)
- ☆
An extended abstract of this paper has been presented at The 27th International Symposium on Mathematical Foundations of Computer Science (MFCS’02) (Warsaw, 2002); see [16].
- 1
Research partially supported by NSERC Grant R3143A01.
- 2
Research partially supported by NSERC Grant OGP0041630.
Copyright © 2003 Elsevier B.V. All rights reserved.