A Novel Approach to Classify Nondeterministic Finite Automata Based on More than Two Loops and its Position

International Journal of Computer Science and Engineering
© 2014 by SSRG - IJCSE Journal
Volume 1 Issue 10
Year of Publication : 2014
Authors : Ezhilarasu P, Prakash J, Krishnaraj N, Satheesh Kumar D, Sudhakar K, Parthasarathy C

pdf
Citation:
MLA Style:

Ezhilarasu P, Prakash J, Krishnaraj N, Satheesh Kumar D, Sudhakar K, Parthasarathy C, "A Novel Approach to Classify Nondeterministic Finite Automata Based on More than Two Loops and its Position" SSRG International Journal of Computer Science and Engineering 1.10 (2014): 1-5.

APA Style:

Ezhilarasu P, Prakash J, Krishnaraj N, Satheesh Kumar D, Sudhakar K, Parthasarathy C , (2014). A Novel Approach to Classify Nondeterministic Finite Automata Based on More than Two Loops and its Position. SSRG International Journal of Computer Science and Engineering 1.10, 1-5.

Abstract:

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.

References:

[1] Ezhilarasu P, Prakash J, Krishnaraj N, Satheesh Kumar D, Sudhakar K and Dhiyanesh B, “A Novel Approach to Classify Nondeterministic Finite Automata Based on Single Loop and its Position” International Journal of Advanced Research Trends in Engineering and Technology (IJARTET), Volume 1, Issue 4, 2014. 
[2] Theory of Computation subject handled by Prof.Dr.P.Ezhilarasu for CSE students Batch 2007-2011, Hindusthan College of Engineering and Technology, Coimbatore. 
[3] Formal Languages and Automata Theory subject handled by Prof.Dr.P.Ezhilarasu for CSE students Batch 2008-2012, Hindusthan College of Engineering and Technology, Coimbatore. 
[4] Formal Languages and Automata Theory subject handled by Prof.Dr.P.Ezhilarasu for CSE students Batch 2010-2014, Hindusthan College of Engineering and Technology, Coimbatore
[5] Theory of Computation subject handled by Prof.J.Prakash for CSE students Batch 2011-2015, Hindusthan College of Engineering and Technology, Coimbatore. 
[6] Theory of Computation subject handled by Prof.J.Prakash for CSE students Batch 2012-2016, Hindusthan College of Engineering and Technology, Coimbatore.

Key Words:

NFA, DFA, Regular Expression, Containing, Starting, Ending.,