> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.SF (isSF, isSFM) where
> import LTK.FSA
> import LTK.Algebra
>
> isSF :: (Ord n, Ord e) => FSA n e -> Bool
> isSF :: FSA n e -> Bool
isSF = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isSFM (SynMon n e -> Bool) -> (FSA n e -> SynMon n e) -> FSA n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. FSA n e -> SynMon n e
forall e n.
(Ord e, Ord n) =>
FSA n e -> FSA ([Maybe n], [Symbol e]) e
syntacticMonoid
>
>
>
> isSFM :: (Ord n, Ord e) => SynMon n e -> Bool
> isSFM :: SynMon n e -> Bool
isSFM = (SynMon n e -> Set (Set (State ([Maybe n], [Symbol e]))))
-> SynMon n e -> Bool
forall n e. (FSA n e -> Set (Set (State n))) -> FSA n e -> Bool
trivialUnder SynMon n 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