Copyright	(c) 2019 Dakotah Lambert
License	MIT
Safe Haskell	Safe-Inferred
Language	Haskell2010

LTK.Decide.SL

Description

This module implements an algorithm to decide whether a given FSA is Strictly Local (SL).

Since: 0.2

Synopsis

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

Documentation

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

Returns True iff the stringset represented by the given FSA is Strictly Local, that is, if it satisfies Suffix-Substition Closure for some specific factor size \(k\).