E-O DFA: A Novel Finite Automata that recognizes Evenor Odd numbers
P. Sri Ram Chandra, G. Venkateswara Rao, G.V. Swamy · Journal of Critical Reviews · 2020
The theory of automata and its computation is exemplified as calculation by means of three essential theoretical machines namely Finite Automata, Pushdown Automata and Turing Machine. This manuscript proposes a sketch of Deterministic Finite Automata that recognizes the Even or Odd numbers when represented in binary form and the suitable validations were also presented.