LTK.Learn.SL

This module implements a string extension learner for the SL class.

Since: 0.3

Documentation

data SLG a

A representation of an SL grammar.

Constructors

SLG

Fields

• slgAlpha :: Set a
• slgK :: Int
• slg :: Set (Bool, [a], Bool)

Instances

HasAlphabet SLG

Defined in LTK.Learn.SL

Methods

alphabet :: SLG e -> Set e

Grammar SLG

Defined in LTK.Learn.SL

Methods

genFSA :: (NFData a, Ord a) => SLG a -> FSA Integer a

augmentG :: Ord a => SLG a -> SLG a -> SLG a

isSubGOf :: Ord a => SLG a -> SLG a -> Bool

emptyG :: Ord a => SLG a

Eq a => Eq (SLG a)

Defined in LTK.Learn.SL

Methods

(==) :: SLG a -> SLG a -> Bool

(/=) :: SLG a -> SLG a -> Bool

Ord a => Ord (SLG a)

Defined in LTK.Learn.SL

Methods

compare :: SLG a -> SLG a -> Ordering

(<) :: SLG a -> SLG a -> Bool

(<=) :: SLG a -> SLG a -> Bool

(>) :: SLG a -> SLG a -> Bool

(>=) :: SLG a -> SLG a -> Bool

max :: SLG a -> SLG a -> SLG a

min :: SLG a -> SLG a -> SLG a

(Read a, Ord a) => Read (SLG a)

Defined in LTK.Learn.SL

Methods

readsPrec :: Int -> ReadS (SLG a)

readList :: ReadS [SLG a]

readPrec :: ReadPrec (SLG a)

readListPrec :: ReadPrec [SLG a]

Show a => Show (SLG a)

Defined in LTK.Learn.SL

Methods

showsPrec :: Int -> SLG a -> ShowS

show :: SLG a -> String

showList :: [SLG a] -> ShowS

fSL :: Ord a => Int -> [a] -> SLG a

Return the set of \(k\)-factors under successor in the given word. Factors are triples, where the first and last components are Booleans that indicate whether the factor is anchored at its head or tail, respectively, and the central component is the factor itself. If a word is short enough to not contain any \(k\)-factors, the entire word, appropriately anchored, is included in the set.