This application is based on one of the concept of "Theory of Computation". It initially take the inputs for number of states and alphabets. Thereafter, the NFA accordion will appear which will display the basic details for the input NFA and ask to fill its state transition table as inputs. After clicking on convert to DFA, two more accordion will appear of DFA information and diagram respectively. DFA information contains basic information of the output DFA as well as its state transition table whereas DFA diagram will contain the DFA state transition diagram which gets created dynamically on clicking on convert using the stack of circular container, quadratic bezier curves and arrow icons.