| Copyright | (c) João Saraiva 20012002200320042005 |
|---|---|
| License | LGPL |
| Maintainer | jas@di.uminho.pt |
| Stability | provisional |
| Portability | portable |
| Safe Haskell | Safe |
| Language | Haskell98 |
Language.HaLex.Minimize
Contents
Description
Minimization of the States of a Deterministica Finite Automata
Code Included in the Lecture Notes on Language Processing (with a functional flavour).
- minimizeDfa :: (Eq sy, Ord st) => Dfa st sy -> Dfa [[st]] sy
- stdMinimizeDfa :: (Ord st, Ord sy) => Dfa st sy -> Dfa [st] sy
- minimizeExp :: Ord st => Dfa st sy -> Dfa [st] sy
- minimizeNdfa :: (Eq sy, Ord st) => Ndfa st sy -> Dfa [[st]] sy
- reverseDfa :: Eq st => Dfa st sy -> Ndfa st sy
- reverseDfaAsDfa :: (Ord st, Eq sy) => Dfa st sy -> Dfa [st] sy
- reverseNdfa :: Eq st => Ndfa st sy -> Ndfa st sy
Minimization
Minimize the number of states of a given Dfa.
This function uses Brzozowski's algorithm
Minimize the number of states of a given Dfa.
This minimization algorithm is described in "An Introduction to Formal Languages and Automata", Peter Linz, 3rd Ed. Jones and Bartlett Publishers
Minimize the number of states of a given Dfa.
(a third algorithm)
Minimize the number of states of a given Ndfa.
This function uses Brzozowski's algorithm
Reversing Automata
Reverse a Dfa