Chomsky hierarchy classification in computational theory

Tari, Somayyeh

doi:10.22108/msci.2021.125480.1393

Chomsky hierarchy classification in computational theory

Document Type : Promotional Paper

Author

Somayyeh Tari

Department of Mathematics, Faculty of Basic Sciences, Shahid Madani University of Azerbaijan, Tabriz, Iran

10.22108/msci.2021.125480.1393

Abstract

A comprehensive understanding of fundamental concepts and basics in any scientific field is necessary for its progress. The continuous growth of computer science topics, both from a descriptive mechanics and a formal descriptive perspective, also demands this. Therefore, this article provides a brief overview of one of the fundamental topics in the field of computational theory (Chomsky hierarchy classification).

Keywords

References

[1] J. Faizan, Techniques for Context-Free Grammar Induction and Applications: Application of novel inference algo-rithms to software maintenance problems, Germany, VDM Verlag Dr. Müller, 2009.
[2] J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
[3] P. Linz, Introduction to Formal Languages and Automata, 5th edition, Canada, Jones Bartlett Learning, 2011.
[4] J. C. Martin, Introduction to Languages and The Theory of Computation, 4th edition, New York, McGraw-Hill Education, 2010.

[5] M. Sipser, Introduction to the Theory of Computation, 3rd edition, United States, Cengage Learning, 2012.