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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Hardback. Condición: 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. Nº de ref. del artículo: 00108291851
Cantidad disponible: 1 disponibles
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
Hardcover. Condición: 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. Nº de ref. del artículo: 0387949070-7-1
Cantidad disponible: 1 disponibles
Librería: Book Dispensary, Concord, ON, Canada
Hardcover. Condición: Very Good. VERY GOOD hardcover, no marks in text, clean exterior. Book. Nº de ref. del artículo: 148929
Cantidad disponible: 1 disponibles
Librería: GoldBooks, Denver, CO, Estados Unidos de America
Hardcover. Condición: new. New Copy. Customer Service Guaranteed. Nº de ref. del artículo: 97J90_83_0387949070
Cantidad disponible: 1 disponibles
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
Hardback. Condición: 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. Nº de ref. del artículo: GOR003375305
Cantidad disponible: 1 disponibles
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
hardcover. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: Q-0387949070
Cantidad disponible: 1 disponibles
Librería: eCampus, Lexington, KY, Estados Unidos de America
Condición: New. Nº de ref. del artículo: N:9780387949079:ONHAND
Cantidad disponible: 2 disponibles
Librería: SHIMEDIA, Brooklyn, NY, Estados Unidos de America
Condición: New. Satisfaction Guaranteed or your money back. Nº de ref. del artículo: 0387949070
Cantidad disponible: 1 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: 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. Nº de ref. del artículo: 9780387949079
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 9780387949079
Cantidad disponible: 2 disponibles