/dfa-pro

Deterministic finite automata implementation in Prolog

Primary LanguageProlog

DFA

Main predicates

accept

?- accept(+Automata, ?Word)

iff word is accepted by Automata. If Word is a variable, predicate generates all words accepted by Automata.

equal

?-  (+Automata1, +Automata2)

iff L(Automata1) = L(Automata2).

subsetEq

?- subsetEq(+Automata1, +Automata2)

iff L(Automata1) ⊆ L(Automata2).

Tests

After loading both dfa.pl and unit_tests.pl, run

?- run_tests.