|
Language.HaLex.Minimize | Portability | portable | Stability | provisional | Maintainer | jas@di.uminho.pt |
|
|
|
|
|
Description |
Minimization of the States of a Deterministica Finite Automata
Code Included in the Lecture Notes on
Language Processing (with a functional flavour).
|
|
Synopsis |
|
|
|
|
Minimization
|
|
|
:: (Eq sy, Ord st) | | => Dfa st sy | Original Dfa
| -> Dfa [[st]] sy | Equivalent Minimized Dfa
| Minimize the number of states of a given Dfa.
This function uses Brzozowski's algorithm
|
|
|
|
:: (Ord st, Ord sy) | | => Dfa st sy | Original Dfa
| -> Dfa [st] sy | Equivalent Minimized Dfa
| 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
|
|
|
|
:: Ord st | | => Dfa st sy | Original Dfa
| -> Dfa [st] sy | Equivalent Minimized Dfa
| Minimize the number of states of a given Dfa.
(a third algorithm)
|
|
|
|
:: (Eq sy, Ord st) | | => Ndfa st sy | Original Ndfa
| -> Dfa [[st]] sy | Equivalent Minimized Dfa
| Minimize the number of states of a given Ndfa.
This function uses Brzozowski's algorithm
|
|
|
Reversing Automata
|
|
|
|
|
|
:: (Ord st, Eq sy) | | => Dfa st sy | Orginal Dfa
| -> Dfa [st] sy | Resulting Dfa
| Reverse a Dfa into a Dfa. It uses a Ndfa as an intermediate representation.
|
|
|
|
|
|
Produced by Haddock version 2.3.0 |