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

LTK.Decide.LAcom

Description

This module implements an algorithm to decide whether a given FSA has a syntactic semigroup which is Locally Commutative and Aperiodic, a near superclass of the Locally Threshold Testable languages.

Since: 1.1

Synopsis

isLAcom :: (Ord n, Ord e) => FSA n e -> Bool
isLAcomM :: (Ord n, Ord e) => SynMon n e -> Bool
isLAcoms :: FiniteSemigroupRep s => s -> Bool

Documentation

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

True iff the automaton recognizes a LAcom stringset.

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

True iff the monoid recognizes a LAcom stringset.

isLAcoms :: FiniteSemigroupRep s => s -> Bool Source #

True iff the semigroup recognizes a LAcom stringset.

Since: 1.2