Introduction To Automata Theory, Languages And Computation (Addisonwesley Series In Computer Science)
Introduction To Automata Theory, Languages And Computation (Addisonwesley Series In Computer Science)
Introduction To Automata Theory, Languages And Computation (Addisonwesley Series In Computer Science)
Introduction To Automata Theory, Languages And Computation (Addisonwesley Series In Computer Science)
Introduction To Automata Theory, Languages And Computation (Addisonwesley Series In Computer Science)

Introduction To Automata Theory, Languages And Computation (Addisonwesley Series In Computer Science)

In Stock
SKU: SONG020102988X
Brand: Pearson
Condition: Used
Regular price$9.62
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

1 Hardcover Book(No Dust Cover)

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

  • Q: What is the page count of this book? A: This book contains four hundred twenty-eight pages. It is a comprehensive resource for understanding automata theory and computation.
  • Q: What are the dimensions of this book? A: The book measures nine point five three inches in length and zero point seven nine inches in width. It is designed for easy handling and storage.
  • Q: What type of binding does this book have? A: This book features a hardcover binding. This ensures durability and longevity for repeated use.
  • Q: Who is the author of this book? A: The author of this book is John E. Hopcroft. He is well-known for his contributions to the field of computer science.
  • Q: What is the main subject of this book? A: This book focuses on automata theory, languages, and computation. It is categorized under mathematics, making it suitable for academic study.
  • Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners and advanced readers alike. It provides foundational concepts as well as advanced topics in automata theory.
  • Q: How can I best utilize this book for study? A: You can use this book as a textbook for courses in computer science or as a reference for self-study. It includes examples and exercises for practice.
  • Q: Is there a specific reading level for this book? A: This book is targeted towards college-level students and professionals. A background in mathematics or computer science is beneficial for understanding its content.
  • Q: What is the recommended age group for this book? A: This book is recommended for readers aged eighteen and older. It is designed for those pursuing higher education in mathematics or computer science.
  • Q: How should I care for this hardcover book? A: To keep this book in good condition, store it upright on a shelf and avoid exposing it to moisture. Dust it regularly with a soft cloth.
  • Q: Can this book be returned if I'm not satisfied? A: Yes, you can return this book if you are not satisfied. Please check the seller's return policy for specific details.
  • Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller immediately for a replacement or refund. Keep all packaging materials for the return process.
  • Q: Is this book appropriate for a course on formal languages? A: Yes, this book is appropriate for courses on formal languages. It covers essential topics that are foundational in this area of study.
  • Q: How does this book compare to others in its field? A: This book is considered a classic in the field of automata theory. It is often compared favorably due to its depth and clarity of explanation.
  • Q: What kind of exercises are included in this book? A: The book includes various exercises aimed at reinforcing the concepts discussed. These exercises range from theoretical questions to practical problems.
  • Q: Are there other editions or versions of this book? A: Yes, there are other editions of this book, but this hardcover edition is highly regarded for its quality and content.

Recently Viewed