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

> This module implements an algorithm to decide whether a syntactic
> semigroup \(S\) is tier-based locally Piecewise Testable (TLPT).
> This is the case iff its tier-projection is LPT.
>
> @since 1.0
> -}
> module LTK.Decide.TLPT (isTLPT, isTLPTM) where

> import LTK.FSA
> import LTK.Decide.LPT (isLPT, isLPTM)
> import LTK.Tiers (project)
> import LTK.Algebra (SynMon)

> -- |True iff the automaton recognizes a TLPT stringset.
> isTLPT :: (Ord n, Ord e) => FSA n e -> Bool
> isTLPT :: FSA n e -> Bool
isTLPT = FSA n e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isLPT (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

> -- |True iff the monoid recognizes a TLPT stringset.
> isTLPTM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTLPTM :: SynMon n e -> Bool
isTLPTM = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLPTM (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