An Efficient Way Of Implementing DFA Automatically For Divisibility Of Decimal Numbers

Theory of computation is always been an issue for the learners to understand. It is a mathematical based subject. We known that in mathematics if example has been changed then the steps are also remains same but in Theory of Computation, if example has been changed then steps are also changes. It is always issue of learners to understand the examples of DFA. JFLAP (Java Formal Languages and Automata Package) is a software tool used for the designing of finite automata. We can design any kinds of DFA in JFLAP by manually. Drawing a DFA manually is a time consuming process. The validation is not handled into JFLAP tool. It is not possible to represent the transition table and definition of DFA, which is helpful for understanding the design of DFA. In this paper we are implementing the DFA for divisibility of any decimal numbers, which include finding transition states, design of transition table with process, transition graph and definition of DFA with tuples. We have constructed a DFA for divisibility of any decimal numbers. We also provided a process of solving any divisibility problem of decimal number and gives divisibility of user entered numbers. Keywordsâ€” DFA, Transition States, Transition Table, Transition Graph (TG), Divisibility.