Copyright	(c) 2021-2024 Dakotah Lambert
License	MIT
Safe Haskell	Safe-Inferred
Language	Haskell2010

LTK.Decide.TLPT

Description

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

Synopsis

isTLPT :: (Ord n, Ord e) => FSA n e -> Bool
isTLPTM :: (Ord n, Ord e) => SynMon n e -> Bool
isTLPTs :: FiniteSemigroupRep s => s -> Bool

Documentation

isTLPT :: (Ord n, Ord e) => FSA n e -> Bool #

True iff the automaton recognizes a TLPT stringset.

isTLPTM :: (Ord n, Ord e) => SynMon n e -> Bool #

True iff the monoid recognizes a TLPT stringset.

isTLPTs :: FiniteSemigroupRep s => s -> Bool #

True iff the semigroup recognizes a TLPT stringset.

Since: 1.2