2020•Journal of Critical ReviewsOpen access

E-O DFA: A Novel Finite Automata that recognizes Evenor Odd numbers

P. Sri Ram Chandra, G. Venkateswara Rao, G.V. Swamy

Abstract

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.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: DFA minimization, Nested word, ω-automaton, Deterministic finite automaton, Quantum finite automata, Nondeterministic finite automaton, Automata theory, Finite-state machine