We use cookies to maintain website functionality, enhance our services, personalize user experience, analyze website performance, and process book search queries efficiently. For more details, please refer to our Privacy Policy.

Theory of Computation: Formal Languages, Automata, and Complexity

(4)
Theory of Computation: Formal Languages, Automata, and Complexity image
ISBN-10:

0805301437

ISBN-13:

9780805301434

Edition: 1
Released: Jan 11, 1989
Publisher: Pearson
Format: Paperback, 320 pages

Description:

This book is designed to serve as a test for a one-semester introductory course in the theory of computation. It covers the traditional topics of formal languages, automata, computability, and computational complexity. (from preface)

Best prices to buy, sell, or rent ISBN 9780805301434




Frequently Asked Questions about Theory of Computation: Formal Languages, Automata, and Complexity

You can buy the Theory of Computation: Formal Languages, Automata, and Complexity book at one of 20+ online bookstores with BookScouter, the website that helps find the best deal across the web. Currently, the best offer comes from and is $ for the .

If you’re interested in selling back the Theory of Computation: Formal Languages, Automata, and Complexity book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.

As for the Theory of Computation: Formal Languages, Automata, and Complexity book, the best buyback offer comes from and is $ for the book in good condition.

Not enough insights yet.

Not enough insights yet.