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

Ezhilarasu P; Prakash J; Krishnaraj N; Satheesh Kumar D; Sudhakar K; Parthasarathy C

doi:https://doi.org/10.14445/22315381/IJETT-V18P228

Research Article | Open Access | Download PDF

Volume 18 | Number 1 | Year 2014 | Article Id. IJETT-V18P228 | DOI : https://doi.org/10.14445/22315381/IJETT-V18P228

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

Ezhilarasu P, Prakash J, Krishnaraj N, Satheesh Kumar D, Sudhakar K, Parthasarathy C

Citation :

Ezhilarasu P, Prakash J, Krishnaraj N, Satheesh Kumar D, Sudhakar K, Parthasarathy C, "A Novel Approach to Classify Nondeterministic Finite Automata Based on Dual Loop and its Position," International Journal of Engineering Trends and Technology (IJETT), vol. 18, no. 1, pp. 147-150, 2014. Crossref, https://doi.org/10.14445/22315381/IJETT-V18P228

Abstract

Generally Finite Automata is classified as Nondeterministic Finite Automata and Deterministic Finite Automata. In this paper we classify Nondeterministic Finite Automata based on two factors. 1. Dual loop 2. Position, namely starting state, ending state and intermediate state (except starting and ending state). Using the aforementioned factors, loops are placed at any two positions out of available three positions. As a result we can get three NFA types, namely 1. Containing condition NFA 2. Containing and starting condition NFA 3. Containing and ending condition NFA.

Keywords

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

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.