Theory of Computation: Automata, Formal Languages, Computation and Complexity

Author:   K.R. Chowdhary
Publisher:   Springer Verlag, Singapore
Edition:   2024 ed.
ISBN:  

9789819762330


Pages:   644
Publication Date:   20 March 2025
Format:   Hardback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $316.77 Quantity:  
Add to Cart

Share |

Theory of Computation: Automata, Formal Languages, Computation and Complexity


Add your own review!

Overview

This book offers a fresh perspective on the study and teaching of the Theory of Computation. The author's selection of topics and the comprehensive set of questions demonstrate extensive knowledge and years of experience in both teaching and research. It addresses practical aspects of computing models that are often overlooked. The book's emphasis on pedagogy, through carefully crafted exercises and clear elucidation of learning outcomes and chapter summaries, is a refreshing approach to the subject. With the right platform, this book has the potential to be adopted as a textbook in universities worldwide. The book covers new developments not typically addressed in other texts on the subject, such as algebraic theory, new applications of finite automata and regular languages, and topics from compiler theory that are closely related. It also explores several new relationships among models, with a natural progression of chapters. Key strengths of this book include its coverage of contemporary and relevant topics, practical applications of theoretical concepts, an extended Chomsky Hierarchy, and discussions on decidability, undecidability, and unsolvability. The book is tailored for its intended audience, with selected chapters suitable for undergraduate B.Tech./B.E. computer science students. Additionally, Chapters 9–14 can be used for a course on ""Advanced Topics in Theory of Computer Science"" at the Master's level (M.E./M.Tech.). It also serves as a foundational resource for those engaged in research in computer science.

Full Product Details

Author:   K.R. Chowdhary
Publisher:   Springer Verlag, Singapore
Imprint:   Springer Nature
Edition:   2024 ed.
ISBN:  

9789819762330


ISBN 10:   9819762332
Pages:   644
Publication Date:   20 March 2025
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Mathematical Preliminaries.- Finite Automata and Regular Expressions.- Variants of Finite Automata.- Minimization of Finite Automata.- Regular Languages.

Reviews

Author Information

Professor K. R. Chowdhary currently teaches at JNV University, Jodhpur. He received his Bachelor's degree in Electronics & Communication Engineering with Honors division and later his Ph.D. from the same institution, in the area of Natural Language Processing. His career has traversed diverse landscapes, encompassing pivotal roles in both research and education. His professional trajectory includes contributions in Research & Developments at Bhabha Atomic Research Centre in Mumbai, imparting knowledge and expertise as a faculty member at the IIT Jodhpur. His research interests encompass a wide spectrum of topics, including automata theory, formal languages, complexity theory, distributed processing, artificial intelligence, machine learning, natural language, and speech processing.  

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List