> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.LPT (isLPT, isLPTM, isLPTs) where
> import Data.Representation.FiniteSemigroup
> import LTK.FSA
> import LTK.Algebra
>
> isLPT :: (Ord n, Ord e) => FSA n e -> Bool
> isLPT :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isLPT = GeneratedAction -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isLPTs (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
>
> isLPTM :: (Ord n, Ord e) => SynMon n e -> Bool
> isLPTM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLPTM = FSA ([Maybe n], [Symbol e]) e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isLPT
>
>
>
> isLPTs :: FiniteSemigroupRep s => s -> Bool
> isLPTs :: forall s. FiniteSemigroupRep s => s -> Bool
isLPTs = (FSMult -> Bool) -> s -> Bool
forall s. FiniteSemigroupRep s => (FSMult -> Bool) -> s -> Bool
locally FSMult -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isJTrivial