Description
This book, which has been well received and appreciated by the students of computer science in various institutes across the country, has been revised and fully updated. Designed specifically for undergraduates and postgraduates new to the subject, this text offers a clear, authoritative and comprehensive introduction to the subject. The text opens with an excellent overview of the key theories and perspectives of theory of automata and formal languages-placing the subject in a winder context-and continues with detailed treatments of all key topics.
Table of Contents
Chapter 1: Basic Concepts
Chapter 2:Finite Automata
Chapter 3: Regular Expressions and Regular Sets
Chapter 4: Context Free Grammar
Chapter 5: Pushdown Automation
Chapter 6: Properties of CLF
Chapter 7: Turing Machine
Chapter 8: Recursive Enumerable and Recursive Language
Chapter 9: Undecidability
Chapter 10: Chomsky Hierarchy
Chapter 11:Recursive Function Theory
Author
A.P. Shukla
A.P. Shukla is Associate Professor, Department of Computer
Science & Engineering, Krishna Institute of Engineering & Technology
(KIET), Ghaziabad, Uttar Pradesh. With a B.E. and M. Tech degree in Computer
Science & Engineering and Ph. D. (Pursuing) in Computer Science &
Engineering (IIT, Delhi) he has over a decade of experience in research and
teaching. He has published several research papers as well as guided
students. He has received several honors, served as member of many professional
bodies, organized seminars and been a well known author. |
Reviews
There are no reviews yet.