  Problem Solving in Automata, Languages, and Complexity
ISBN: 978-0-471-43960-8
Hardcover
408 pages
October 2001
US $147.00
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 5-6 days delivery time. The book is not returnable.
Other Available Formats: E-Book
|
An online version of this product is available through our subscription-based content service. Visit Wiley Online Library now |
Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
Share This
