menu
{ "item_title" : "Theory of Computation", "item_author" : [" Pradeeba V "], "item_description" : "Theory of Computation offers a clear, structured introduction to the mathematical foundations of computer science. Written for students of Computer Science, Information Technology, and Artificial Intelligence, this book systematically builds from formal languages and finite automata to context-free grammars, pushdown automata, Turing machines, and the outer limits of computability and complexity.Each concept is explained with worked examples, step-by-step constructions, and illustrative diagrams - from designing DFAs and NFAs to constructing Linear Bounded Automata for context-sensitive languages. Rather than treating automata theory as an abstract exercise, the authors connect it to real computational reasoning: what can be computed, what cannot, and why.Ideal for undergraduate and postgraduate coursework, competitive exam preparation, and self-study, this book equips readers with both conceptual clarity and problem-solving fluency in the theory that underlies every computer program ever written.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/9/79/890/722/9798907220508_b.jpg", "price_data" : { "retail_price" : "37.99", "online_price" : "37.99", "our_price" : "37.99", "club_price" : "37.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Theory of Computation|Pradeeba V

Theory of Computation : Concepts and Models

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Other Available Formats

Paperback
37.99
Hardcover
$51.99

show all formats

Overview

Theory of Computation offers a clear, structured introduction to the mathematical foundations of computer science. Written for students of Computer Science, Information Technology, and Artificial Intelligence, this book systematically builds from formal languages and finite automata to context-free grammars, pushdown automata, Turing machines, and the outer limits of computability and complexity.

Each concept is explained with worked examples, step-by-step constructions, and illustrative diagrams - from designing DFAs and NFAs to constructing Linear Bounded Automata for context-sensitive languages. Rather than treating automata theory as an abstract exercise, the authors connect it to real computational reasoning: what can be computed, what cannot, and why.

Ideal for undergraduate and postgraduate coursework, competitive exam preparation, and self-study, this book equips readers with both conceptual clarity and problem-solving fluency in the theory that underlies every computer program ever written.

This item is Non-Returnable

Details

  • ISBN-13: 9798907220508
  • ISBN-10: 9798907220508
  • Publisher: Notion Press
  • Publish Date: September 2026
  • Dimensions: 11 x 8.5 x 0.56 inches
  • Shipping Weight: 1.37 pounds
  • Page Count: 266

Related Categories

You May Also Like...

    1

    1

BAM Customer Reviews