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
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
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the models rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a wellpaced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of contextfree languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gdels incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer,
birth defects, or other reproductive harm.
Unfortunately, my copy of this book came with a torn cover and some pages bent. The content is useful for my studies, covering automata and computability, but I wish it had been packaged better for shipping. I hope to get a replacement soon!
E
Emily Johnson
Arrived Damaged, But Useful
Unfortunately, my copy of this book came with a torn cover and some pages bent. The content is useful for my studies, covering automata and computability, but I wish it had been packaged better for shipping. I hope to get a replacement soon!
E
Emily Johnson
Arrived Damaged, But Useful
Unfortunately, my copy of this book came with a torn cover and some pages bent. The content is useful for my studies, covering automata and computability, but I wish it had been packaged better for shipping. I hope to get a replacement soon!
R
Raj Patel
Good Content, But Lacks Depth
This text covers the basics of automata and computability well, but I was hoping for more depth in some areas. It’s a decent book for undergraduates, but advanced students might find it a bit lacking. Still, it's a solid starting point!
R
Raj Patel
Good Content, But Lacks Depth
This text covers the basics of automata and computability well, but I was hoping for more depth in some areas. It’s a decent book for undergraduates, but advanced students might find it a bit lacking. Still, it's a solid starting point!
For MAP (Minimum Advertised Price) violations and Intellectual Property (IP) or Trademark concerns, please contact:
support@ergodebooks.com
⚠️ California Proposition 65 Warning: Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm. For more information, visit www.P65Warnings.ca.gov.
