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

LTK.Decide.LT

Description

This module implements an algorithm to decide whether a given FSA is Locally Testable (LT) based on the semigroup characterization of Brzozowski and Simon from their 1973 work "Characterizations of locally testable events".

Since: 0.2

Synopsis

isLT :: (Ord n, Ord e) => FSA n e -> Bool
isLTM :: (Ord n, Ord e) => SynMon n e -> Bool
isLTs :: FiniteSemigroupRep s => s -> Bool

Documentation

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

True iff the automaton recognizes an LT stringset.

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

True iff the given monoid is locally a semilattice.

Since: 1.0

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

True iff the given semigroup is locally a semilattice.

Since: 1.2