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

LTK.Decide.LPT

Description

This module implements an algorithm to decide whether a syntactic semigroup $S$ is locally Piecewise Testable (LPT). This is the case iff each of its idempotents $e$ satisfies the property that $eSe$ is $\mathcal{J}$ -trivial.

Since: 1.0

Synopsis

isLPT :: (Ord n, Ord e) => FSA n e -> Bool
isLPTM :: (Ord n, Ord e) => SynMon n e -> Bool
isLPTs :: FiniteSemigroupRep s => s -> Bool

Documentation

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

True iff the automaton recognizes an LPT stringset.

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

True iff the monoid is locally $\mathcal{J}$ -trivial.

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

True iff the semigroup is locally $\mathcal{J}$ -trivial.

Since: 1.2

Key	Shortcut
s	Open this search box
esc	Close this search box
↓,ctrl + j	Move down in search results
↑,ctrl + k	Move up in search results
↵	Go to active search result