language-toolkit-1.2.0.0: A set of tools for analyzing languages via logic and automata
Copyright(c) 2019 Dakotah Lambert
LicenseMIT
Safe HaskellSafe-Inferred
LanguageHaskell2010

LTK.Decide.SP

Description

This module implements an algorithm to decide whether a given FSA is Strictly Piecewise (SP) by my own direct-construction algorithm.

Since: 0.2

Synopsis

Documentation

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

Returns True iff the stringset represented by the given FSA is Strictly Piecewise, that is, if the FSA accepts all subsequences of every string it accepts.