Garantía de entrega
SKU/Artículo: AMZ-3031439724
Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)
Format:
Hardcover
Detalles del producto
Disponibilidad:
En stock
En stock
Peso con empaque:
1.11 kg
1.11 kg
Devolución:
Sí
Sí
Condición
Nuevo
Nuevo
Producto de:
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.
U$S 75,98
44% OFF
U$S 42,21
IMPORTÁ FACIL
Comprando este producto podrás descontar el IVA con tu número de RUT
NO CONSUME FRANQUICIA
Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.
U$S 75,98
44% OFF
U$S 42,21
¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!
Llega en 5 a 11 días hábiles
con envío
Tienes garantía de entrega
Compra protegida
Disfruta de una experiencia de compra segura y confiable
![]()
Garantía de entrega
Con Tiendamia todas tus compras cuentan con Garantía de Entrega o devolución total de tu dinero.
Compras 100% seguras y garantizadas, para que pidas lo que soñás y lo recibas del mundo a tu puerta.
Saber más.
Tarjetas prepagas, debito, y credito
Paga hasta en 12 cuotas sin interés con tarjetas de crédito.
Visa
Mastercard
American Express
Dinners
Discover
Lider
Midinero
OCA
OCA Blue
Tarjeta PREX
Pagos a través de PayPal
Paga en dólares con Tarjetas internacionales a través de PayPal.
PayPal
