Imagen del editor

Automata and Computability

Dexter C. Kozen

25 valoraciones por Goodreads
ISBN 10: 0387949070 / ISBN 13: 9780387949079
Editorial: Springer
Nuevos Condición: New Encuadernación de tapa dura
Comprar nuevo
Precio recomendado: 84.95
Precio: EUR 107,66 Convertir moneda
Gastos de envío: EUR 3,31 A Estados Unidos de America Destinos, gastos y plazos de envío
Añadir al carrito

Ofrecido por

BuySomeBooks
Las Vegas, NV, Estados Unidos de America

Valoración 5 estrellas

Librería en AbeBooks desde: 21 de mayo de 2012

Descripción

Hardcover. 400 pages. Dimensions: 9.3in. x 7.1in. x 1.3in.This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the models 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 Gdels 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. N° de ref. de la librería 9780387949079

Cantidad: > 20

Hacer una pregunta a la librería

Detalles bibliográficos

Título: Automata and Computability

Editorial: Springer

Encuadernación: Hardcover

Condición del libro: New

Tipo de libro: Hardcover

Acerca de

Sinopsis:

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Descripción de la librería

BuySomeBooks is great place to get your books online. With over eight million titles available we're sure to have what you're looking for. Despite having a large selection of new books available for immediate shipment and excellent customer service, people still tell us they prefer us because of our prices.

Ver la página web de la librería

Condiciones de venta:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

BuySomeBooks is operated by Drive-On-In, Inc., a Nevada co...

Más información
Condiciones de envío:

Orders usually ship within 1-2 business days. Books are shipped from multiple locations so your order may arrive from Las Vegas,NV, Roseburg,OR, La Vergne,TN, Momence,IL, or Commerce,GA.

Todos los libros de esta librería

Métodos de pago
aceptados por la librería

Visa Mastercard American Express Carte Bleue