|
Language.HaLex.Equivalence | Portability | portable | Stability | provisional | Maintainer | jas@di.uminho.pt |
|
|
|
Description |
Equivalence of Regular Expressions
Code Included in the Lecture Notes on
Language Processing (with a functional flavour).
|
|
Synopsis |
|
|
|
Documentation |
|
|
:: (Ord st, Ord sy) | | => Dfa st sy | Deterministic Automaton
| -> Dfa st sy | Deterministic Automaton
| -> Bool | Equivalent?
| Test whether two Dfa are quivalent or not.
|
|
|
|
:: (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.
|
|
|
|
:: Ord sy | | => RegExp sy | Regular Expression
| -> RegExp sy | Regular Expression
| -> Bool | Equivalent?
| Test whether two RegExp are quivalent or not.
|
|
|
|
:: Ord sy | | => [RegExp sy] | List of Regular Expressions
| -> Bool | Equivalent?
| Test whether a list of RegExp are quivalent or not.
|
|
|
Produced by Haddock version 2.3.0 |