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

LTK.Decide.Finite

Description

This module implements an algorithm to decide whether a given FSA is finite. Also included for convenience is a test for cofiniteness.

Since: 1.0

Synopsis

Documentation

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

True iff the automaton accepts only finitely many words.

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

True iff the automaton accepts all but finitely many words.