UMinho Haskell Libraries (1.0) Contents Index

Language.HaLex.FaClasses Portability portable Stability provisional Maintainer jas@di.uminho.pt

Description

The Class of Finite Automaton in Haskell Code Included in the Lecture Notes on Language Processing (with a functional flavour).

Synopsis

class Fa fa st sy where accept :: fa st sy -> [sy] -> Bool sizeFa :: fa st sy -> Int equiv :: fa st sy -> fa st sy -> Bool minimize :: fa st sy -> Dfa [[st]] sy reverseFa :: fa st sy -> Ndfa st sy toHaskell' :: fa st sy -> String -> IO () toGraph :: fa st sy -> String -> String toGraphIO :: fa st sy -> String -> IO () unionFa :: fa st sy -> fa st sy -> Ndfa st sy concatFa :: fa st sy -> fa st sy -> Ndfa st sy starFa :: fa st sy -> Ndfa st sy plusFa :: fa st sy -> Ndfa st sy

Produced by Haddock version 0.6