fst-0.10.0.1: Finite state transducers

Safe HaskellSafe-Inferred
LanguageHaskell98

FST.LBFA

Contents

Description

Left-biased finite automata

Synopsis

Documentation

Types

data LBFA a Source

Data type for LBFA (left-biased finite automata)

Instances

Functions on LBFA

initial :: LBFA a -> StateTy Source

Get the initial state of a LBFA

compileToLBFA :: Ord a => Reg a -> Sigma a -> StateTy -> LBFA a Source

Compile a regular expression to a LBFA

compileToAutomaton :: Ord a => Reg a -> Sigma a -> StateTy -> Automaton a Source

Compile a regular expression to an minimal, useful and deterministic automaton, using the LBFA algorithm while building.