Introd. to Automata Theory & Formal Lang.
Book Details:
• Author: Adesh K. Pandey
• Publisher: S.K. Kataria & Sons
• Edition: Reprint 2012
• Language: English
• Number of Pages: 425
• Binding: Paperback
• Release Date: 01 January 2012
• ISBN: 9788188458479
About the Book:
This book is a comprehensive guide to automata theory and formal languages, specially designed for computer science and information technology students. Written by Adesh K. Pandey, the book explains the concepts of automata, grammars, computation models, and language theory in a clear and systematic manner.
The book covers important topics including finite automata, automata with output, regular expressions and languages, properties of regular languages, context-free grammars, pushdown automata, properties of context-free languages, Turing machines, recursive function theory, Chomsky hierarchy, and tractable and intractable problems. It also includes model question papers, solved and unsolved examination papers, references, and skill-based exercises for academic preparation and self-assessment.
With well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, theoretical computer science learning, competitive examinations, and programming language theory.
Product Information
Product Information
Shipping & Returns
Shipping & Returns
Description
Book Details:
• Author: Adesh K. Pandey
• Publisher: S.K. Kataria & Sons
• Edition: Reprint 2012
• Language: English
• Number of Pages: 425
• Binding: Paperback
• Release Date: 01 January 2012
• ISBN: 9788188458479
About the Book:
This book is a comprehensive guide to automata theory and formal languages, specially designed for computer science and information technology students. Written by Adesh K. Pandey, the book explains the concepts of automata, grammars, computation models, and language theory in a clear and systematic manner.
The book covers important topics including finite automata, automata with output, regular expressions and languages, properties of regular languages, context-free grammars, pushdown automata, properties of context-free languages, Turing machines, recursive function theory, Chomsky hierarchy, and tractable and intractable problems. It also includes model question papers, solved and unsolved examination papers, references, and skill-based exercises for academic preparation and self-assessment.
With well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, theoretical computer science learning, competitive examinations, and programming language theory.
