De: R$ 0,00Por: R$ 857,00ou X de
Calcule o frete:
Para envios internacionais, simule o frete no carrinho de compras.
Calcule o valor do frete e prazo de entrega para a sua região
Sinopse
The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, context-free grammars, pushdown automata, Chomsky and Greibach normal forms, context-free parsing, pumping theorems for regular and context-free languages, closure theorems and decision procedures for regular and context-free languages, Turing machines, nondeterminism, decidability and undecidability, the Church-Turing thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of first-order logic, asymptotic dominance, time and space complexity, the Cook-Levin theorem, NP-completeness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of theundecidability of the safety of a simple protection framework.
Ficha Técnica
Especificações
ISBN | 9780132288064 |
---|---|
Pré venda | Não |
Peso | 1250g |
Autor para link | RICH ELAINE A. |
Livro disponível - pronta entrega | Não |
Dimensões | 23 x 16 x 1 |
Tipo item | LIVRO IMPORTADO ADQ MERC INTERNO |
Número de páginas | 1120 |
Número da edição | 1ª EDIÇÃO - 2007 |
Código Interno | 548087 |
Código de barras | 9780132288064 |
Acabamento | HARDCOVER |
Autor | RICH, ELAINE A. |
Editora | PRENTICE HALL |
Sob encomenda | Sim |