HaLeX-1.2.6: HaLeX enables modelling, manipulation and visualization of regular languages

Copyright(c) João Saraiva 20012002200320042005
LicenseLGPL
Maintainerjas@di.uminho.pt
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

Language.HaLex.Equivalence

Description

Equivalence of Regular Expressions

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

Synopsis

Documentation

equivDfa Source #

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.

equivNdfa Source #

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.

equivRE Source #

Arguments

:: Ord sy 
=> RegExp sy

Regular Expression

-> RegExp sy

Regular Expression

-> Bool

Equivalent?

Test whether two RegExp are quivalent or not.

equivREs Source #

Arguments

:: Ord sy 
=> [RegExp sy]

List of Regular Expressions

-> Bool

Equivalent?

Test whether a list of RegExp are quivalent or not.