Simple DFA Construction Algorithm Using Divide-and-Conquer Approach

In real-world applications like network software design, pattern recognition, compiler construction moreover in some of the applications of formal and natural language like accepter, spell checker and advisor, language dictionary, the Deterministic Finite Automata (DFA) plays an important role. For such applications, specification rules to construct DFA are more complex in nature. More generally, the rules consist of the intricate words like ‘and’, ‘or’, ‘not having’, ‘followed by’. Constructing DFA for such rules is time-consuming and tedious process. To make the construction process easier, simple DFA construction algorithm is proposed. The proposed algorithm is based on divide-and-conquer (D&C) algorithm design strategy. To apply D&C, the first step is to divide given language specification rule into a number of manageable pieces of sub-language specification rules, second construct DFA for each sub-language by any efficient method and at last, combine the DFA using closure properties of the regular set to obtain resultant DFA. To verify the correctness of the proposed algorithm, the obtained resultant DFA is compared with DFA constructed by a conventional method.