Introduction to Automata Theory, Formal Languages and Computation

Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simple and exhaustive approach to topics like automata theory, formal languages and theory of computation. These descriptions are followed by numerous relevant examples related to the topic. A brief introductory chapter on compilers explaining its relation to theory of computation is also given.

Table of Contents

Chapter 1 : Basic Terminology

Chapter 2 : Language and Grammar

Chapter 3 : Finite Automata

Chapter 4 : Finite State Machine

Chapter 5 : Regular Expression

Chapter 6 : Context-free Grammar

Chapter 7 : Pushdown Automata

Chapter 8: Turing Machine

Chapter 9: Variations of the Turing Machine

Chapter 10 : Computability and Undecidability

Chapter 11 : Recursive Function

Chapter 12 : Computational Complexity

Chapter 13 : Basics of Compiler Design

Chapter 14: Advance Topics Related to Automata

About the Author

Shyamalendu Kandar is an Assistant Professor in the Department of Information Technology at the Indian Institute of Engineering Science and Technology (IIEST), Shibpur. His research interests include areas such as secret sharing, image encryption, remote user authentication, and intelligent transport systems. Additionally, he has also worked as an Assistant Professor in the Computer Science and Engineering department at Haldia Institute of Technology.