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

LTK.Decide.PT

Description

This module implements an algorithm to decide whether a given FSA is Piecewise Testable (PT) based on the semigroup characterization of Simon from his 1975 work "Piecewise testable events".

Since: 0.2

Synopsis

isPT :: (Ord n, Ord e) => FSA n e -> Bool
isPTM :: (Ord n, Ord e) => SynMon n e -> Bool
isPTs :: FiniteSemigroupRep s => s -> Bool

Documentation

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

True iff the automaton recognizes a PT stringset.

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

True iff the monoid is \(\mathcal{J}\)-trivial

Since: 1.0

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

True iff the semigroup is \(\mathcal{J}\)-trivial

Since: 1.2