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

LTK.Decide.SF

Description

This module implements an algorithm to decide whether a given FSA is Star-Free (SF) based on the semigroup characterization of Schutzenberger as reported by Pin in his chapter "Syntactic Semigroups" of "Handbook of Formal Languages"

Since: 0.2

Synopsis

isSF :: (Ord n, Ord e) => FSA n e -> Bool
isSFM :: (Ord n, Ord e) => SynMon n e -> Bool
isSFs :: FiniteSemigroupRep s => s -> Bool

Documentation

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

True iff the automaton recognizes a Star-Free stringset.

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

True iff the monoid is aperiodic.

Since: 1.0

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

True iff the semigroup is aperiodic.

Since: 1.2