Copyright | (c) 20192021-2024 Dakotah Lambert |
---|---|
License | MIT |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
This module implements an algorithm to decide whether a given FSA is Tier-Based Locally Testable (TLT) by my own algorithm.
Since: 0.2
Documentation
isTLT :: (Ord n, Ord e) => FSA n e -> Bool Source #
True iff the automaton recognizes a TLT stringset.
isTLTM :: (Ord n, Ord e) => SynMon n e -> Bool Source #
True iff the monoid recognizes a TLT stringset.
Since: 1.0
isTLTs :: FiniteSemigroupRep s => s -> Bool Source #
True iff the semigroup recognizes a TLT stringset.
Since: 1.2