Safe Haskell	Safe-Inferred
Language	Haskell2010

Haal.Automaton.DFA

Description

This module implements a simple deterministic finite automaton (DFA).

Synopsis

Documentation

type DFA state input = MooreAutomaton state input Bool Source #

DFA is just a synonym for a MooreAutomaton with Bool type of output'.

mkDFA :: (s -> i -> s) -> (s -> Bool) -> Set s -> s -> DFA s i Source #

Constructor for a DFA value.