> {-# OPTIONS_HADDOCK show-extensions #-}
> {-|
> Module    : LTK.Decide.PT
> Copyright : (c) 2019-2021 Dakotah Lambert
> License   : MIT

> This module implements an algorithm to decide whether a given FSA
> is Piecewise Testable (PT) based on the semigroup characterization
> of Simon from his 1975 work "Piecewise testable events".
>
> @since 0.2
> -}
> module LTK.Decide.PT (isPT, isPTM) where

> import LTK.FSA
> import LTK.Algebra

> -- |True iff the automaton recognizes a PT stringset.
> isPT :: (Ord n, Ord e) => FSA n e -> Bool
> isPT :: FSA n e -> Bool
isPT = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isPTM (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

> -- |True iff the monoid is \(\mathcal{J}\)-trivial
> --
> -- @since 1.0
> isPTM :: (Ord n, Ord e) => SynMon n e -> Bool
> isPTM :: SynMon n e -> Bool
isPTM = (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 e n.
(Ord e, Ord n) =>
FSA ([Maybe n], [Symbol e]) e
-> Set (Set (State ([Maybe n], [Symbol e])))
jEquivalence