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

> This module implements an algorithm to decide whether a given FSA
> is Tier-Based Locally Acom (TLAcom) by my own algorithm.
>
> @since 1.1
> -}
> module LTK.Decide.TLAcom (isTLAcom, isTLAcomM, isTLAcoms) where

> import Data.Representation.FiniteSemigroup

> import LTK.Decide.LAcom (isLAcom, isLAcomM, isLAcoms)
> import LTK.FSA (FSA)
> import LTK.Tiers (project)
> import LTK.Algebra (SynMon)

> -- |True iff the automaton recognizes a TLAcom stringset.
> isTLAcom :: (Ord n, Ord e) => FSA n e -> Bool
> isTLAcom :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isTLAcom = FSA n e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isLAcom (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 TLAcom stringset.
> isTLAcomM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTLAcomM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isTLAcomM = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLAcomM (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

> -- |True iff the semigroup recognizes a TLAcom stringset.
> --
> -- @since 1.2
> isTLAcoms :: FiniteSemigroupRep s => s -> Bool
> isTLAcoms :: forall s. FiniteSemigroupRep s => s -> Bool
isTLAcoms = FSMult -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isLAcoms (FSMult -> Bool) -> (s -> FSMult) -> s -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. s -> FSMult
forall s. FiniteSemigroupRep s => s -> FSMult
projectedSubsemigroup