A Novel Approach to Classify Nondeterministic Finite Automata Based on Dual Loop and its Position

Generally Finite Automata has 3 positions, particularly beginning state, ending state and intermediate state (except beginning and ending state). Usually we have a tendency to square measure having only one beginning state and one acceptive state. In some cases we have a tendency to square measure having over one acceptive state. By neglecting those cases, we have a tendency to square measure having completely 2 state,s considering beginning and ending state. If we have a tendency to place a loop at those 2 states, the remaining loop is to be placed at intermediate state. Therefore we've got minimum one loop at intermediate state. By inserting one loop, two loops and over 2 loops at intermediate state we have a tendency to get 3 forms of NFA. 1.NFA that contains 2 or more Substring 2. NFA that starts with a substring and contains 2 or more Substring 3. NFA that ends with a substring and contains 2 or more Substring.