> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.TLT (isTLT, isTLTM, isTLTs) where
> import Data.Representation.FiniteSemigroup
> import LTK.Decide.LT (isLT, isLTM, isLTs)
> import LTK.FSA (FSA)
> import LTK.Tiers (project)
> import LTK.Algebra (SynMon)
>
> isTLT :: (Ord n, Ord e) => FSA n e -> Bool
> isTLT :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isTLT = FSA n e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isLT (FSA n e -> Bool) -> (FSA n e -> FSA n e) -> FSA n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. FSA n e -> FSA n e
forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project
>
>
>
> isTLTM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTLTM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isTLTM = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLTM (SynMon n e -> Bool)
-> (SynMon n e -> SynMon n e) -> SynMon n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. SynMon n e -> SynMon n e
forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project
>
>
>
> isTLTs :: FiniteSemigroupRep s => s -> Bool
> isTLTs :: forall s. FiniteSemigroupRep s => s -> Bool
isTLTs = FSMult -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isLTs (FSMult -> Bool) -> (s -> FSMult) -> s -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. s -> FSMult
forall s. FiniteSemigroupRep s => s -> FSMult
projectedSubsemigroup