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

> This module implements an algorithm to decide whether a given FSA
> is Definite (Def) or Reverse Definite (RDef) based on the classic
> semigroup characterizations summarized by Brzozowski and Fich in
> their 1984 work "On Generalized Locally Testable Languages".
>
> @since 1.0
> -}
> module LTK.Decide.Definite
>     ( -- *Plain
>       isDef
>     , isDefM
>     , isRDef
>     , isRDefM
>       -- *Tier-Based
>     , isTDef
>     , isTDefM
>     , isTRDef
>     , isTRDefM
>     ) where

> import qualified Data.Set as Set

> import LTK.FSA
> import LTK.Algebra
> import LTK.Tiers (project)

> -- |True iff the automaton recognizes a definite stringset,
> -- characterized by a set of permitted suffixes.
> isDef :: (Ord n, Ord e) => FSA n e -> Bool
> isDef :: FSA n e -> Bool
isDef = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isDefM (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 \(Se=e\) for idempotents \(e\).
> isDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isDefM :: SynMon n e -> Bool
isDefM SynMon n e
s = (Set (State ([Maybe n], [Symbol e])) -> Bool)
-> [Set (State ([Maybe n], [Symbol e]))] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all ((Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
==Int
1) (Int -> Bool)
-> (Set (State ([Maybe n], [Symbol e])) -> Int)
-> Set (State ([Maybe n], [Symbol e]))
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Set (State ([Maybe n], [Symbol e])) -> Int
forall a. Set a -> Int
Set.size) ([Set (State ([Maybe n], [Symbol e]))] -> Bool)
-> (Set (State ([Maybe n], [Symbol e]))
    -> [Set (State ([Maybe n], [Symbol e]))])
-> Set (State ([Maybe n], [Symbol e]))
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (State ([Maybe n], [Symbol e])
 -> Set (State ([Maybe n], [Symbol e])))
-> [State ([Maybe n], [Symbol e])]
-> [Set (State ([Maybe n], [Symbol e]))]
forall a b. (a -> b) -> [a] -> [b]
map (SynMon n e
-> State ([Maybe n], [Symbol e])
-> Set (State ([Maybe n], [Symbol e]))
forall n e.
(Ord n, Ord e) =>
FSA (n, [Symbol e]) e
-> State (n, [Symbol e]) -> Set (State (n, [Symbol e]))
primitiveIdealL SynMon n e
s)
>            ([State ([Maybe n], [Symbol e])]
 -> [Set (State ([Maybe n], [Symbol e]))])
-> (Set (State ([Maybe n], [Symbol e]))
    -> [State ([Maybe n], [Symbol e])])
-> Set (State ([Maybe n], [Symbol e]))
-> [Set (State ([Maybe n], [Symbol e]))]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Set (State ([Maybe n], [Symbol e]))
-> [State ([Maybe n], [Symbol e])]
forall a. Set a -> [a]
Set.toList (Set (State ([Maybe n], [Symbol e])) -> Bool)
-> Set (State ([Maybe n], [Symbol e])) -> Bool
forall a b. (a -> b) -> a -> b
$ SynMon n e -> Set (State ([Maybe n], [Symbol e]))
forall n e. (Ord n, Ord e) => FSA (n, [Symbol e]) e -> Set (T n e)
idempotents SynMon n e
s

> -- |True iff the automaton recognizes a reverse definite stringset,
> -- characterized by a set of permitted prefixes.
> isRDef :: (Ord n, Ord e) => FSA n e -> Bool
> isRDef :: FSA n e -> Bool
isRDef = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isRDefM (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 \(eS=e\) for idempotents \(e\).
> isRDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isRDefM :: SynMon n e -> Bool
isRDefM SynMon n e
s = (Set (State ([Maybe n], [Symbol e])) -> Bool)
-> [Set (State ([Maybe n], [Symbol e]))] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all ((Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
==Int
1) (Int -> Bool)
-> (Set (State ([Maybe n], [Symbol e])) -> Int)
-> Set (State ([Maybe n], [Symbol e]))
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Set (State ([Maybe n], [Symbol e])) -> Int
forall a. Set a -> Int
Set.size) ([Set (State ([Maybe n], [Symbol e]))] -> Bool)
-> (Set (State ([Maybe n], [Symbol e]))
    -> [Set (State ([Maybe n], [Symbol e]))])
-> Set (State ([Maybe n], [Symbol e]))
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (State ([Maybe n], [Symbol e])
 -> Set (State ([Maybe n], [Symbol e])))
-> [State ([Maybe n], [Symbol e])]
-> [Set (State ([Maybe n], [Symbol e]))]
forall a b. (a -> b) -> [a] -> [b]
map (SynMon n e
-> State ([Maybe n], [Symbol e])
-> Set (State ([Maybe n], [Symbol e]))
forall n e. (Ord n, Ord e) => FSA n e -> State n -> Set (State n)
primitiveIdealR SynMon n e
s)
>            ([State ([Maybe n], [Symbol e])]
 -> [Set (State ([Maybe n], [Symbol e]))])
-> (Set (State ([Maybe n], [Symbol e]))
    -> [State ([Maybe n], [Symbol e])])
-> Set (State ([Maybe n], [Symbol e]))
-> [Set (State ([Maybe n], [Symbol e]))]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Set (State ([Maybe n], [Symbol e]))
-> [State ([Maybe n], [Symbol e])]
forall a. Set a -> [a]
Set.toList (Set (State ([Maybe n], [Symbol e])) -> Bool)
-> Set (State ([Maybe n], [Symbol e])) -> Bool
forall a b. (a -> b) -> a -> b
$ SynMon n e -> Set (State ([Maybe n], [Symbol e]))
forall n e. (Ord n, Ord e) => FSA (n, [Symbol e]) e -> Set (T n e)
idempotents SynMon n e
s

> -- |Definite on some tier.
> isTDef :: (Ord n, Ord e) => FSA n e -> Bool
> isTDef :: FSA n e -> Bool
isTDef = FSA n e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isDef (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

> -- |Definite on the projected subsemigroup.
> isTDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTDefM :: SynMon n e -> Bool
isTDefM = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isDefM (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

> -- |Reverse definite on some tier.
> isTRDef :: (Ord n, Ord e) => FSA n e -> Bool
> isTRDef :: FSA n e -> Bool
isTRDef = FSA n e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isRDef (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

> -- |Reverse definite on the projected subsemigroup.
> isTRDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTRDefM :: SynMon n e -> Bool
isTRDefM = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isRDefM (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