A Failure Deterministic Finite Automaton (FDFA) is an automaton that contains symbol transitions as well as the so-called failure transitions.
I present a toolkit for generating FDFAs from DFAs. The toolkit has various algorithms that convert a DFA into an FDFA. They are the variants of DFA-Homomorphic Algorithm (DHA), and a version of the Delayed-input Deterministic Finite Automata (D2FA). The algorithms are respectively published at DHA and D2FA. The kit also contains an implementation of an algorithm that simultaneously construct a DFA and an FDFA in a "random" manner.
The source code (in C++) is available for download at FDFA_Algorithms.
No comments:
Post a Comment