TY  - JOUR
TI  - Application Review of Automata Theory
AU  - Aparna
AU  -  Dr. Gulshan Goyal
JO  - International Journal of Scientific Research in Computer Science, Engineering and Information Technology
PB  - Technoscience Academy
DA  - 2018/02/28
PY  - 2018
DO  - https://doi.org/10.32628/IJSRCSEIT
UR  - https://ijsrcseit.com/CSEIT1831184
VL  - 3
IS  - 1
SP  - 947	
EP  - 955
AB  - A formal language is described as a set of strings following a defined pattern over a given alphabet. An automaton is a machine, which is used to process the formal languages. The field of automata theory finds number of applications in literature. Present paper reviews few of them. The application domain considered in present study includes compiler design, time granularity, deep packet inspection and DNA evolution. The aim of present study is to explore the applicability of concept in described field. For this, research papers have been reviewed to infer that the principles and concepts of automata are being used in fields as diverse as networking to a field like biology and bio-informatics. From the review, it has been concluded that each automaton, which is available, is a representation of a real-life scenario and they can be used to solve other problems. The review is quite helpful for novel researchers in the field of formal languages and automata theory to understand applicability of field in variety of applications.