Automata, Computability and Complexity / Libristo.pl
Automata, Computability and Complexity

Code: 01981867

Automata, Computability and Complexity

by Elaine Rich

The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of ... more


Out of stock

Availability alert

Add to wishlist

You might also like

Availability alert

Availability alert


Your agreement - Submiting you agree to the Terms and Condtions.

We will watch availability for you

Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.

More about Automata, Computability and Complexity

Book synopsis

The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology. 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 the undecidability of the safety of a simple protection framework.

Book details

Book category Books in English Mathematics & science Mathematics Mathematical foundations

Trending among others


Books by language

250 000
safisfied customers

Since 2008, we have served long line of book lovers, but each of them was always on the first place.


Paczkomat 12,99 ZŁ 31975 punktów

Copyright! ©2008-24 libristo.pl All rights reservedPrivacyPoučení o cookies


Account: Log in
Wszystkie książki świata w jednym miejscu. I co więcej w super cenach.

Shopping cart ( Empty )

For free shipping
shop for 299 zł and more

You are here: