> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.GLPT (isGLPT, isGLPTM, isGLPTs) where
> import Data.Representation.FiniteSemigroup
> import LTK.FSA
> import LTK.Algebra(SynMon)
>
>
>
>
> isGLPT :: (Ord n, Ord e) => FSA n e -> Bool
> isGLPT :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isGLPT = GeneratedAction -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isGLPTs (GeneratedAction -> Bool)
-> (FSA n e -> GeneratedAction) -> FSA n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. FSA n e -> GeneratedAction
forall n e. (Ord n, Ord e) => FSA n e -> GeneratedAction
syntacticSemigroup
>
> isGLPTM :: (Ord n, Ord e) => SynMon n e -> Bool
> isGLPTM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isGLPTM = FSA ([Maybe n], [Symbol e]) e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isGLPT
>
>
>
> isGLPTs :: FiniteSemigroupRep s => s -> Bool
> isGLPTs :: forall s. FiniteSemigroupRep s => s -> Bool
isGLPTs = (FSMult -> Bool) -> [FSMult] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all FSMult -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isJTrivial ([FSMult] -> Bool) -> (s -> [FSMult]) -> s -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. s -> [FSMult]
forall s. FiniteSemigroupRep s => s -> [FSMult]
emee