A New Approach to the Design of a Finite Automaton that accepts Class of IPV4 Addresses
P.Sri Ram Chandra, K.S. Sravan, M.S. Chakravarthy · International Journal of Mathematical Sciences and Computing · 2019
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 IPV 4 Addresses.