On generating a random deterministic finite automaton as well as its failure equivalent
Madoda Nxumalo, DG Kourie, Loek Cleophas, Bruce W. Watson · TU/e Research Portal · 2015
An algorithm is proposed that constructs a failure deterministic finite automaton in lockstep with the construction of a languageequivalent deterministic finite automaton. The states of both automata are assumed to be predefined and the failure deterministic finite automaton's symbol and failure transitions are randomised. It is guaranteed that the latter remains free of divergent failure cycles. The benefits are explained of using this algorithm to produce input data for testing algorithms that produce a language-equivalent FDFA from an arbitrary DFA.