Copyright | (c) 2022 Dakotah Lambert |
---|---|
License | MIT |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
This module implements an algorithm to decide whether a given FSA is in B, the subclass of FO2[<] where all elements are idempotent but the operation is not necessarily commutative. Thus, this is a superclass of CB. The local and tier-local extensions are also provided.
Since: 1.0
Documentation
isB :: (Ord n, Ord e) => FSA n e -> Bool Source #
True iff the automaton recognizes a band stringset.
isLB :: (Ord n, Ord e) => FSA n e -> Bool Source #
True iff the recognized stringset is locally a band.