• Prof Arun N
• Prof Anusha S
• Dr. Rajapraveen Kumar N

Automata theory that is also considered as theory computation is defined as a branch of the theory of computer science and mathematics that generally focuses on the logic of computation in respect to easy machines which are referred to as automata. The philosophy of computation in theoretical computer science is the field that utilizes an algorithm to decide whether something how questions can easily be solved on a mathematical model. The sciences are classified into three major groups: theory of technology, programming science and science of machine sophistication. Computer scientists use a conceptual representation of machines called the numerical model to perform a systematic analysis of computing. Various methods are being implemented, but the Turing machine is the most frequently studied. This paper presents a comprehensive review of the theory of computation along with its applications.

Automata, Computer Science, Computation, Machine Theory, States and Transactions.

"Review on Theory of Computation", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.418-423, February-2019, Available :http://www.jetir.org/papers/JETIREV06066.pdf

"Review on Theory of Computation", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp418-423, February-2019, Available at : http://www.jetir.org/papers/JETIREV06066.pdf