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.
From the Back Cover
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Automata and Computability
Seller Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: clickgoodwillbooks, Indianapolis, IN, U.S.A.
Seller rating 5 out of 5 stars
Condition: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media. Seller Inventory # CSIV.0387949070.A
Seller Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: Goodwill Books, Hillsboro, OR, U.S.A.
Seller rating 5 out of 5 stars
Condition: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Seller Inventory # 3IIT2J0011V9_ns
Stock Image
Automata and Computability
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0387949070I3N00
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: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00094757936
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0387949070
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: BennettBooksLtd, San Diego, NV, 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: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 671842-n
Stock Image
Automata and Computability (Undergraduate Texts in Computer Science)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2215580174278
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 New York 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