Computation and Automata

About The Book

This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions formal languages and automata computational complexity and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics it proceeds to some of the most important recent developments in theoretical computer science.
Piracy-free
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
downArrow

Details


LOOKING TO PLACE A BULK ORDER?CLICK HERE