Copyright | (c) 2021-2024 Dakotah Lambert |
---|---|
License | MIT |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
This module implements an algorithm to decide whether a given FSA is generalized locally testable in the sense of Brzozowski and Fich (1984): https://doi.org/10.1016/0012-365X(84)90045-1
Since: 1.0
Documentation
isGLT :: (Ord n, Ord e) => FSA n e -> Bool #
True iff the automaton recognizes a generalized locally-testable stringset.
isGLTM :: (Ord n, Ord e) => SynMon n e -> Bool #
True iff the monoid satisfies the generalized local testabiltiy condition.
isGLTs :: FiniteSemigroupRep s => s -> Bool #
True iff the semigroup lies in \(M_e J_1\).
Since: 1.2