Application Review of Automata Theory

Authors(2) :-Aparna, Dr. Gulshan Goyal

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.

Authors and Affiliations

Student, Department of CSE, Chandigarh College of Engineering and Technology, Chandigarh, India
Dr. Gulshan Goyal
Assistant Professor, Department of CSE, Chandigarh College of Engineering and technology, Chandigarh, India

Automata, Compiler, Cellular Automata, Time Granularity, Packet Inspection.

  1. Bresolin, D., Montanari, A., & Puppis, G. (2009), "A theory of ultimately periodic languages and automata with an application to time granularity", Acta Informatica, Vol. 46, Issue 5, pp. 331-360.
  2. Yu, F., Chen, Z., Diao, Y., Lakshman, T. V., & Katz, R. H. (2006), "Fast and memory-efficient regular expression matching for deep packet inspection. ACM/IEEE Symposium Architecture for Networking and Communications systems (ANCS), pp. 93-102.
  3. Andrews, G., & Dobrin, A. (2005), "Cellular Automata and Applications", pp. 1-6.
  4. Mitchell, M. (1996). "Computation in cellular automata: A selected review". Nonstandard Computation, pp. 95-140.
  5. Bettini, C., Jajodia, S., & Wang, S. (2000), " Time granularities in databases, data mining, and temporal reasoning", edition 1, Springer Science & Business Media, pp. 11-18.
  6. Loma Linda International Heart Institute: Paediatric heart transplantation protocol. Tech. rep., International Heart Institute, Loma Linda University Medical Center, Loma Linda, CA (2002). Available at:
  7. Emerson, E. A. (1990), "Temporal and modal logic", Handbook of Theoretical Computer Science: Formal Models and Semantics, MIT press, pp. 995-1072.
  8. Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2001), "Introduction to automata theory, languages, and computation". ACM Sigact News, Vol. 32, Issue 1, pp. 60-65.
  9. Green, T. J., Gupta, A., Miklau, G., Onizuka, M., & Suciu, D. (2004), "Processing XML streams with deterministic automata and stream indexes" ACM Transactions on Database Systems (TODS),  29, Issue 4, pp. 752-788.
  10. Sommer, R., & Paxson, V. (2003), "Enhancing byte-level network intrusion detection signatures with context" Proceedings of the 10th ACM conference on Computer and communications security, pp. 262-271.
  11. Mizas, C., Sirakoulis, G. C., Mardiris, V., Karafyllidis, I., Glykos, N., & Sandaltzopoulos, R. (2008), "Reconstruction of DNA sequences using genetic algorithms and cellular automata: Towards mutation prediction" Biosystems, 92, Issue 1,  pp. 61-68.
  12. McFadden, J., & Al-Khalili, J. (1999), "A quantum mechanical model of adaptive mutation" Biosystems, Vol. 50, Issue 3, pp.203-211.
  13. Ullman, J. D. (1972), "Applications of language Theory to Compiler Design", Proceedings of the May 16-18, 1972, spring joint computer conference, pp. 235-242(ACM).

Publication Details

Published in : Volume 3 | Issue 1 | January-February 2018
Date of Publication : 2018-02-28
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 947-955
Manuscript Number : CSEIT1831184
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Aparna, Dr. Gulshan Goyal, "Application Review of Automata Theory", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 1, pp.947-955, January-February-2018.
Journal URL :

Article Preview