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

> This module implements an algorithm to decide whether a given FSA
> is Tier-Based Locally Testable (TLT) by my own algorithm.
>
> @since 0.2
> -}
> module LTK.Decide.TLT (isTLT, isTLTM) where

> import LTK.Decide.LT (isLT, isLTM)
> import LTK.FSA (FSA)
> import LTK.Tiers (project)
> import LTK.Algebra (SynMon)

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

> -- |True iff the monoid recognizes a TLT stringset.
> --
> -- @since 1.0
> isTLTM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTLTM :: 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