LTK.Decide.GD

This module implements an algorithm to decide whether a given FSA is Generalized Definite (GD) based on the semigroup characterization, or if it is Tier-Based Generalized Definite (TGD).

Since: 1.0

Documentation

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

True iff the automaton recognizes a generalized definite stringset.

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

True iff the monoid satisfies \(eSe=e\) for all idempotents \(e\).

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

True iff the language is generalized definite for some tier.

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

True iff the projected subsemigroup satisfies eSe=e