HaLeX-1.1: HaLeX enables modelling, manipulation and animation of regular languagesSource codeContentsIndex
Language.HaLex.Equivalence
Portabilityportable
Stabilityprovisional
Maintainerjas@di.uminho.pt
Description

Equivalence of Regular Expressions

Code Included in the Lecture Notes on Language Processing (with a functional flavour).

Synopsis
equivDfa :: (Ord st, Ord sy) => Dfa st sy -> Dfa st sy -> Bool
equivNdfa :: (Ord st, Ord sy) => Ndfa st sy -> Ndfa st sy -> Bool
equivRE :: Ord sy => RegExp sy -> RegExp sy -> Bool
equivREs :: Ord sy => [RegExp sy] -> Bool
Documentation
equivDfaSource
:: (Ord st, Ord sy)
=> Dfa st syDeterministic Automaton
-> Dfa st syDeterministic Automaton
-> BoolEquivalent?
Test whether two Dfa are quivalent or not.
equivNdfaSource
:: (Ord st, Ord sy)
=> Ndfa st syNon-Deterministic Automaton
-> Ndfa st syNon-Deterministic Automaton
-> BoolEquivalent?
Test whether two Ndfa are quivalent or not.
equivRESource
:: Ord sy
=> RegExp syRegular Expression
-> RegExp syRegular Expression
-> BoolEquivalent?
Test whether two RegExp are quivalent or not.
equivREsSource
:: Ord sy
=> [RegExp sy]List of Regular Expressions
-> BoolEquivalent?
Test whether a list of RegExp are quivalent or not.
Produced by Haddock version 2.3.0