Language.HaLex.Sentences

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

Documentation

sentencesRegExp :: Ord sy => RegExp sy -> [[sy]]

Generates a set of sentences of the language defined by a given Regular Expression

sentencesNdfa :: (Ord sy, Ord st) => Ndfa st sy -> [[sy]]

Generates a set of sentences of the language defined by a given NonDerterministic Finite Automaton

sentencesDfa :: (Ord st, Eq sy, Ord sy) => Dfa st sy -> [[sy]]

Generates a set of sentences of the language defined by a given Deterministic Finite Automaton.

It computes a set of paths starting from the start state and ending in an accepting state, which include all transitions/edges of the automaton.

This function does not computes the smallest set (of paths/sentebces), as computed by the "Chinese Postman Problem"

Function written by MSc student José Nuno Macedo (72424) in the context of the 2016/17 edition of the course "Analysis and Testing of Software", MIEI, Univ. Minho.

onePathDfa :: (Ord st, Ord sy) => Dfa st sy -> [sy]

This function computes one sentence of the language defined by a deterministic fininte automaton