The aim of this book is to provide a comprehensive foundation in the principles of automata theory, formal languages, and computational theory. This book covers essential topics such as finite automata, regular languages, context-free grammars, Turing machines, and decidability. Through theoretical concepts and practical applications, it equips students with the tools to understand and analyze the fundamental aspects of computation and its applications in computer science.
- 212 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Introduction to Automata Theory, Languages, and Computation
About this book
Trusted by 375,005 students
Access to over 1.5 million titles for a fair monthly price.
Study more efficiently using our study tools.
Information
Edition
0Table of contents
- Cover
- Title Page
- Copyright
- About the Author
- Table of Contents
- List of Figures
- List of Table
- Preface
- CHAPTER 1: INTRODUCTION TO AUTOMATA
- CHAPTER 2: FINITE AUTOMATAAND REGULAR EXPRESSIONS
- CHAPTER 3: COMPUTATIONAL COMPLEXITY
- CHAPTER 4: CONTEXT-FREEGRAMMAR AND LANGUAGES
- CHAPTER 5: PUSHDOWN AUTOMATA
- CHAPTER 6: DECIDABILITY
- CHAPTER 7: TURING MACHINES
- CHAPTER 8: COMPUTABILITY AND UNDECIDABILITY
- INDEX
- Back Cover