Theory of Automata and Computation
Book Details:
• Author: Adesh K. Pandey
• Publisher: S.K. Kataria & Sons
• Edition: 2010
• Language: English
• Number of Pages: 325
• Binding: Paperback
• Release Date: 01 January 2010
• ISBN: 9789350140055
Description:
This book is a comprehensive introduction to automata theory and formal languages, specially designed for computer science and information technology students. Written by Adesh K. Pandey, the book explains the fundamental concepts of automata and computational theory in a clear and systematic manner.
The book covers important topics including finite automata, Mealy and Moore machines, regular expressions, regular languages, context-free grammars, pushdown automata, Turing machines, linear bounded automata, context-sensitive languages, and tractable and untractable problems. It also includes model question papers and skill-based exercises for academic preparation and self-assessment.
With well-organized content and easy-to-understand explanations, this book serves as an excellent academic resource for university studies, technical courses, and competitive examinations related to theoretical computer science and automata theory.
Original: $3.17
-65%$3.17
$1.11Product Information
Product Information
Shipping & Returns
Shipping & Returns
Description
Book Details:
• Author: Adesh K. Pandey
• Publisher: S.K. Kataria & Sons
• Edition: 2010
• Language: English
• Number of Pages: 325
• Binding: Paperback
• Release Date: 01 January 2010
• ISBN: 9789350140055
Description:
This book is a comprehensive introduction to automata theory and formal languages, specially designed for computer science and information technology students. Written by Adesh K. Pandey, the book explains the fundamental concepts of automata and computational theory in a clear and systematic manner.
The book covers important topics including finite automata, Mealy and Moore machines, regular expressions, regular languages, context-free grammars, pushdown automata, Turing machines, linear bounded automata, context-sensitive languages, and tractable and untractable problems. It also includes model question papers and skill-based exercises for academic preparation and self-assessment.
With well-organized content and easy-to-understand explanations, this book serves as an excellent academic resource for university studies, technical courses, and competitive examinations related to theoretical computer science and automata theory.
