Normal view MARC view ISBD view

Automata, computability and complexity :

Rich, Elaine.

Automata, computability and complexity : theory and applications Elaine Rich. - New Delhi : Pearson, c2008. - xx, 1099 p. : ill. ; 25 cm.

Includes bibliographical references and index.

Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.

ISBN: 9788131788226

LCCN: 2010275411

Subjects--Topical Terms:
Machine theory.
Computable functions.
Computational complexity.
Electronic data processing.

LC Class. No.: QA267 / .R53 2008

Dewey Class. No.: 511.3 / RIC-A

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)