<p>This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. 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 analyses of effective computability, decidability, and Gödel's incompleteness theorems. 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.</p>
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Hardback. Condizione: 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. Codice articolo 00108291851
Quantità: 1 disponibili
Da: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condizione: 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. Codice articolo 0387949070-7-1
Quantità: 1 disponibili
Da: Book Dispensary, Concord, ON, Canada
Hardcover. Condizione: Very Good. VERY GOOD hardcover, no marks in text, clean exterior. Book. Codice articolo 148929
Quantità: 1 disponibili
Da: WorldofBooks, Goring-By-Sea, WS, Regno Unito
Hardback. Condizione: 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. Codice articolo GOR003375305
Quantità: 1 disponibili
Da: GoldBooks, Denver, CO, U.S.A.
Hardcover. Condizione: new. New Copy. Customer Service Guaranteed. Codice articolo 97J90_83_0387949070
Quantità: 1 disponibili
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title! Codice articolo Q-0387949070
Quantità: 1 disponibili
Da: eCampus, Lexington, KY, U.S.A.
Condizione: New. Codice articolo N:9780387949079:ONHAND
Quantità: 2 disponibili
Da: SHIMEDIA, Brooklyn, NY, U.S.A.
Condizione: New. Satisfaction Guaranteed or your money back. Codice articolo 0387949070
Quantità: 1 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: 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. Codice articolo 9780387949079
Quantità: 1 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: 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. Codice articolo 9780387949079
Quantità: 2 disponibili