> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.SF (isSF, isSFM, isSFs) where
> import Data.Representation.FiniteSemigroup
> import LTK.FSA
> import LTK.Algebra(SynMon)
>
> isSF :: (Ord n, Ord e) => FSA n e -> Bool
> isSF :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isSF = GeneratedAction -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isSFs (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
>
>
>
> isSFM :: (Ord n, Ord e) => SynMon n e -> Bool
> isSFM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isSFM = (FSA ([Maybe n], [Symbol e]) e
-> Set (Set (State ([Maybe n], [Symbol e]))))
-> FSA ([Maybe n], [Symbol e]) e -> Bool
forall n e. (FSA n e -> Set (Set (State n))) -> FSA n e -> Bool
trivialUnder FSA ([Maybe n], [Symbol e]) e
-> Set (Set (State ([Maybe n], [Symbol e])))
forall n e.
(Ord n, Ord e) =>
FSA (n, [Symbol e]) e -> Set (Set (State (n, [Symbol e])))
hEquivalence
>
>
>
> isSFs :: FiniteSemigroupRep s => s -> Bool
> isSFs :: forall s. FiniteSemigroupRep s => s -> Bool
isSFs = s -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isAperiodic