HaLeX-1.2.6: HaLeX enables modelling, manipulation and visualization of regular languages

Language.HaLex.Test_HaLex

Description

Generation of sentences of the (regular) languages defined via Regular Expressions and Finite Autumata

Synopsis

# Documentation

test_size_fa :: (Ord st, Ord sy, Show st, Show sy) => Ndfa st sy -> Test Source #

Test the size of finite automata The size (ie number of states) of a minimized dfa is always less of equal than the size of an equivalent ndfa or dfa.

test_gen_sentences :: (Ord sy, Show sy) => RegExp sy -> Test Source #

Test the acceptance of generated sentences The accpetance functions for RegExp, Ndfa and Dfa should accept all sentences of the language of an equivalent reg. exp.