What do you think?
Rate this book
Theory of Computation for ANNA University
Finite Automata Grammars Pushdown Automata Turing Machines Unsolvable Problems and Computable Functions
518 pages, Paperback
2 people are currently reading
20 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.