innerBanner.jpg

FUE Central Library

Automata, computability and complexity : theory and applications /

Rich, Elaine.

Automata, computability and complexity : theory and applications / Elaine Rich. - xx, 1099 pages : illustrations ; 25 cm.

Includes bibliographical references and index.

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

9780132288064 0132288060

2010275411


Machine theory.
Computable functions.
Computational complexity.
Electronic data processing.

QA267 / .R53 2008

511.3 / R.E.A

Copyright © 2023, Future University Egypt. All rights reserved.