Automata Theory and Formal Languages
- 1st Edition - April 28, 2023
- Authors: Pallavi Vijay Chavan, Ashish Jadhav
- Language: English
- Paperback ISBN:9 7 8 - 0 - 3 2 3 - 9 1 7 8 4 - 1
- eBook ISBN:9 7 8 - 0 - 3 2 3 - 9 7 2 1 7 - 8
Automata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteAutomata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play major roles in developing computing machines, algorithms and code. Automata theory includes numerous concepts such as finite automata, regular grammar, formal languages, context free and context sensitive grammar, push down automata, Turing machine, and decidability, which constitute the backbone of computing machines. This book enables readers to gain sufficient knowledge and experience to construct and solve complex machines.
Each chapter begins with key concepts followed by a number of important examples that demonstrate the solution. The book explains concepts and simultaneously helps readers develop an understanding of their application with real-world examples, including application of Context Free Grammars in programming languages and Artificial Intelligence, and cellular automata in biomedical problems.
- Presents the concepts of Automata Theory and Formal Languages in an easy-to-understand approach
- Helps the readers understand key concepts by solving real-world examples.
- Provides the readers with a simple approach to connect the theory with the latest trend like software testing, cybersecurity, artificial intelligence, and machine learning.
- Includes a wide coverage of applications of automata theory and formal languages.
Researchers, developers, and industry professionals in Information Technology and Computer Science, such as developers of AI and Deep Learning, as well as other research fields, including Biomedical
- Cover image
- Title page
- Table of Contents
- Copyright
- Dedication
- List of figures
- List of tables
- Biography
- Preface
- 1: Background and fundamentals
- Abstract
- 1.1. Objectives and outcomes
- 1.2. Sets
- 1.3. Propositions and logic
- 1.4. Relations
- 1.5. Automata theory fundamentals
- 1.6. Need of automata theory and formal languages
- 1.7. Chapter summary
- 1.8. Multiple choice questions
- 1.9. Exercises
- References
- 2: Finite automata and machines
- Abstract
- 2.1. Objectives and outcomes
- 2.2. Finite automation
- 2.3. Introduction to finite automata
- 2.4. Types of finite automata
- 2.5. Deterministic finite automata
- 2.6. Nondeterministic finite automata
- 2.7. NFA to DFA conversion
- 2.8. Finite automata with ϵ/λ moves
- 2.9. Finite automata with output
- 2.10. Chapter summary
- 2.11. Multiple choice questions
- 2.12. Exercises
- References
- 3: Regular expressions, regular language and grammar
- Abstract
- 3.1. Objectives and outcomes
- 3.2. Regular expressions
- 3.3. Relationship of finite automata and regular expressions
- 3.4. Equivalence of finite automata and regular expression
- 3.5. Closure properties of regular languages
- 3.6. Pumping lemma
- 3.7. Chomsky hierarchy of languages
- 3.8. Concept of grammar
- 3.9. Chapter summary
- 3.10. Multiple choice questions
- 3.11. Exercises
- References
- 4: Context-free grammar
- Abstract
- 4.1. Objectives and outcomes
- 4.2. Context-free grammar
- 4.3. Context-free language
- 4.4. String derivations and parse trees
- 4.5. Ambiguity in CFG
- 4.6. Simplification of CFG
- 4.7. Normal forms of CFG
- 4.8. Chapter summary
- 4.9. Multiple choice questions
- 4.10. Exercises
- References
- 5: Pushdown automata
- Abstract
- 5.1. Objectives and outcomes
- 5.2. Introduction to PDA
- 5.3. Language of PDA
- 5.4. Deterministic PDA
- 5.5. Nondeterministic PDA
- 5.6. Equivalence of CFGs and PDA
- 5.7. Chapter summary
- 5.8. Multiple choice questions
- 5.9. Exercises
- References
- 6: Turing machine
- Abstract
- 6.1. Objectives and outcomes
- 6.2. Introduction to Turing machines
- 6.3. Turing machine variants
- 6.4. Chapter summary
- 6.5. Multiple choice questions
- 6.6. Exercises
- References
- 7: Applications of automata
- Abstract
- 7.1. Objectives and outcomes
- 7.2. Applications of finite automata and regular expressions
- 7.3. Applications of grammars
- 7.4. Applications of pushdown automata
- 7.5. Applications of Turing machine
- 7.6. Concept of cellular automata
- 7.7. Chapter summary
- 7.8. Multiple choice questions
- References
- 8: Automata theory with recent trends
- Abstract
- 8.1. Objectives and outcomes
- 8.2. Introduction
- 8.3. Automata and cybersecurity
- 8.4. Automata and artificial intelligence (AI)/machine learning (ML)
- 8.5. Chapter summary
- 8.6. Multiple choice questions
- References
- A: Answers to multiple choice questions
- B: Notations
- Index
- No. of pages: 232
- Language: English
- Edition: 1
- Published: April 28, 2023
- Imprint: Academic Press
- Paperback ISBN: 9780323917841
- eBook ISBN: 9780323972178
PV
Pallavi Vijay Chavan
Dr. Pallavi Vijay Chavan is Associate Professor in the Department of Information Technology, RAIT, D. Y. Patil Deemed to be University, NERUL, Navi Mumbai, India. During her 20-year carrier, she has worked on a variety of research topics, including Visual Cryptography, Image Processing, Intelligent Systems, Machine Learning and Analytics. She has taught core subjects at the undergrad level including DBMS, Theory of Computation, Artificial Neural Networks, and Soft Computing. Dr. Chavan is the author of dozens of research papers in international journals and conferences, including Springer, Elsevier, Inderscience and IEEE. Dr. Chavan is recipient of research grants from Mumbai University and is a member of ACM and ISTE. Dr. Chavan is the author of Automata Theory and Formal Languages from Elsevier Academic Press.
Affiliations and expertise
Associate Professor – Information Technology Ramrao Adik Institute of Technology, D Y Patil deemed to be UniversityAJ
Ashish Jadhav
Dr. Ashish Jadhav is Professor and Head of Department of Information Technology at Ramrao Adik Institute of Technology, D Y Patil Deemed to be University, Navi Mumbai, MH, India. He has over 34 years experience in industry, academia and research. He has industry experience in working on the technical track on projects related to Cybersecurity, Automotive software and Product Engineering Systems. He has contributed to the working groups for the development of international standard Autosar and other IEEE standards. In his academic engagement, he has published research work in the information theory, machine vision and machine learning domain with reputed publishers in journals, conferences and book chapters. Currently he is guiding 8 Ph.D. research scholars in similar domains. He completed his MS from Birla Institute of Technology and Science, Pilani, Rajasthan, India in 1991, and Ph.D. from Indian Institute of Technology, Kanpur, U.P., India in 1999 in Electrical Engineering.
Affiliations and expertise
Professor and Head, Department of Information Technology, Ramrao Adik Institute of Technology, D Y Patil Deemed to be University, Navi Mumbai, MH, IndiaRead Automata Theory and Formal Languages on ScienceDirect