A New Approach to the Design of a Finite Automaton that accepts Class of IPV4 Addresses

Full Text (PDF, 874KB), PP.65-79

Views: 0 Downloads: 0


P.Sri Ram Chandra 1,* K.S.Sravan 1 M.S.Chakravarthy 1

1. Department of Computer Science and Engineering, Godavari Institute of Engineering and Technology (A), Rajahmundry, Andhra Pradesh, India.

* Corresponding author.

DOI: https://doi.org/10.5815/ijmsc.2019.01.06

Received: 19 Apr. 2018 / Revised: 21 Jun. 2018 / Accepted: 6 Aug. 2018 / Published: 8 Jan. 2019

Index Terms

Finite Automata, IP Address


Theory of computation is characterized as calculation through the conceptual machines. The three essential unique machines utilized are Finite Automata, Pushdown Automata and Turing Machine. In this paper we propose an outline of Finite Automata that accepts the class of IPV4 Addresses.

Cite This Paper

P.Sri Ram Chandra, K.S.Sravan, M.S.Chakravarthy,"A New Approach to the Design of a Finite Automaton that accepts Class of IPV4 Addresses", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.5, No.1, pp.65-79, 2019. DOI: 10.5815/ijmsc.2019.01.06


[1]J.E.Hopcraft and Jeffery D.Ulman: Introduction to Automata Theory, Languages & Computation by–Narosa Publishing Company.

[2]Mishra &Chandra Sekharan: Theory of Computer Science PHI.

[3]Peter Linz: An Introduction to Formal Languages and Automata, 3e by– Narosa Publishing House.

[4]Sipser: Introduction to Theory of Computation, 2/e, Thomson.

[5]Daniel I.A. Cohen: Introduction to Computer Theory, John Wiley.

[6]Behrouz A.Forouzan, Data Communications and Networking, 3rd EditionTMH,2004

[7]William Stallings, Data and Computer Communications, 7th Edition, Pearson Education Inc., 2004.

[8]Martin JC. Introduction to languages and the theory of computation. 3rd edition Tata Mcgraw Hill; 2010.

[9]Saradhi Varma G.P, Tirupathi Rao B, Theory of Computation-Formal Languages and Automata Theory, Scitech Publications.

[10]P. Ezhilarasu, J. Prakash, N. Krishnaraj, D. Satheesh Kumar, K. Suresh Babu and C. Parthasarathy, A Novel Approach to Design the Finite Automata to Accept the Palindrome with the Three Input Characters, Indian Journal of Science and Technology, Vol 8(28), DOI: 10.17485/ijst/2015/v8i28/78189, October 2015.

[11]Ezhilarasu P, Krishnaraj N. Triple Substring Based Classification for Nondeterministic Finite Automata. IJAER. 2015; 10(59):177–82.

[12]Daniel I.A. Cohen, Introduction to Computer Theory, 2nd edition, Wiley Publishers 2007.

[13]S.N. Sivanandam, M. Janaki Meena, Theory of Computation, Published by I.K. International Publishing House Pvt. Ltd.

[14]MARTIN (Author), Introduction To Languages And The Theory Of Computation (), 3rd Edition

[15]S.R. Jena, S.K. Swain, Theory of Computation and Application-2017.