Items related to Automata and Computability (Undergraduate Texts in...
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Automata and Computability (Undergraduate Texts in...
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
Condition: Acceptable. Item in acceptable condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00108291851
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Published by
Springer (edition 1997), 1997
ISBN 10: 0387949070
ISBN 13: 9780387949079
Used
Hardcover
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # 0387949070-7-1
Stock Image
Automata and Computability
Seller: Book Dispensary, Concord, ON, Canada
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. VERY GOOD hardcover, no marks in text, clean exterior. Book. Seller Inventory # 148929
Buy Used
US$ 28.00
US$ 6.99 shipping
Ships from Canada to U.S.A.
Ships from Canada to U.S.A.
Quantity: 1 available
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: GoldBooks, Denver, CO, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. New Copy. Customer Service Guaranteed. Seller Inventory # 97J90_83_0387949070
Stock Image
Automata and Computability
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: 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. Seller Inventory # GOR003375305
Buy Used
US$ 82.70
US$ 7.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0387949070
Seller Image
Automata and Computability
Seller: eCampus, Lexington, KY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # N:9780387949079:ONHAND
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: SHIMEDIA, Brooklyn, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Satisfaction Guaranteed or your money back. Seller Inventory # 0387949070
Stock Image
Automata and Computability (Hardcover)
Published by
Springer-Verlag New York Inc., New York, NY, 1997
ISBN 10: 0387949070
ISBN 13: 9780387949079
New
Hardcover
First Edition
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # 9780387949079
Seller Image
Automata and Computability
Published by
Springer, Springer Apr 1997, 1997
ISBN 10: 0387949070
ISBN 13: 9780387949079
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9780387949079
Buy New
US$ 101.26
US$ 26.42 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available