Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Theory of Computation : Automata, Formal Languages, Computation and Complexity - K. R. Chowdhary

Theory of Computation

Automata, Formal Languages, Computation and Complexity

By: K. R. Chowdhary

eText | 19 March 2025

At a Glance

eText

$169.00

or 4 interest-free payments of $42.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionComputing & I.T.Computer ScienceMathematical Theory of ComputationMathematics

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Amazon.com

Get Big Fast

eBook

$22.99

This is For Everyone - Tim Berners-Lee

eBOOK

This is For Everyone

eBook

$9.99

This product is categorised by