ISBN: 9780387949079 - automata and computability (undergraduate texts in computer science) (20 Ergebnisse)

Hardcover. Zustand: Fair. 1997. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Hardcover. Zustand: Very Good. 1997. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Zustand: Very Good. VERY GOOD hardcover, no marks in text, clean exterior. Book.

Hardback. Zustand: Fair. 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 model's rich and varied structure. Pushdown automata provide a broader class of models and enable the analysis of context-free languages.…

Hardback. Zustand: Fair. 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 model's rich and varied structure. Pushdown automata provide a broader class of models and enable the analysis of context-free languages.…

Hardback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.

Zustand: New.

Zustand: New. Satisfaction Guaranteed or your money back.

Hardcover. Zustand: new. New Copy. Customer Service Guaranteed.

Hardcover. Zustand: new. Hardcover. 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 model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced 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 context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Godel's 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. 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 model's rich and varied structure. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 model's rich and varied structure. Students who already have some experience with elementary discrete mathematics will find this a well-paced 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. Then, material on pushdown automata provides a broader class of models and enables the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's 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.…

Zustand: New. pp. 424.

Hardcover. Zustand: Brand New. 400 pages. 9.75x7.50x1.25 inches. In Stock.

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced 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 context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's 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. 420 pp. Englisch.…

Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Introduction to the basic theoretical models of computability, providing students who have already some experience with elementary discrete mathematics with a well-paced first courseA number of supplementary chapters introduce more advanced concep.…

Zustand: New. Print on Demand pp. 424 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam This item is printed on demand.

Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 model's rich and varied structure. Students who already have some experience with elementary discrete mathematics will find this a well-paced 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. Then, material on pushdown automata provides a broader class of models and enables the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 420 pp. Englisch.…

Zustand: New. PRINT ON DEMAND pp. 424.