|
|
Sold Out
Book Categories |
Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory. Solutions for selected exercises are included as an appendix.
| Price | Condition | Delivery | Seller | Action |
| $157.43 | Digital |
| WonderClub |
Marian Riley
reviewed Introducing the Theory of Computation on February 27, 2015
Introducing the Theory of Computation
An absolutely essential book for representation theory. Well translated etc, the only thing I would say is a fair few of the proofs are needlessly complicated. For instance, I remember early on a proof where we have to prove something for all finite dimensional vector spaces, which one would naturally do by induction starting from a line and working upwards. However, Serre insists on this very obtuse proof in strong induction, starting from the 0 vector space? Very weird.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Introducing the Theory of Computation
X
This Item is in Your Inventory
Introducing the Theory of Computation
X
You must be logged in to review the productsX
X
X
Add Introducing the Theory of Computation, Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and, Introducing the Theory of Computation to the inventory that you are selling on WonderClubX
X
Add Introducing the Theory of Computation, Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and, Introducing the Theory of Computation to your collection on WonderClub |
