| Copyright | (c) João Saraiva 20012002200320042005 |
|---|---|
| License | LGPL |
| Maintainer | jas@di.uminho.pt |
| Stability | provisional |
| Portability | portable |
| Safe Haskell | Safe |
| Language | Haskell98 |
Language.HaLex.Equivalence
Description
Equivalence of Regular Expressions
Code Included in the Lecture Notes on Language Processing (with a functional flavour).
Documentation
Arguments
| :: (Ord st, Ord sy) | |
| => Dfa st sy | Deterministic Automaton |
| -> Dfa st sy | Deterministic Automaton |
| -> Bool | Equivalent? |
Test whether two Dfa are quivalent or not.
Arguments
| :: (Ord st, Ord sy) | |
| => Ndfa st sy | Non-Deterministic Automaton |
| -> Ndfa st sy | Non-Deterministic Automaton |
| -> Bool | Equivalent? |
Test whether two Ndfa are quivalent or not.
Test whether two RegExp are quivalent or not.