Automata, computability and complexity

theory and applications

  • 0 Ratings
  • 3 Want to read
  • 0 Currently reading
  • 0 Have read
Automata, computability and complexity
Elaine A. Rich
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 3 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by OnFrATa
April 26, 2023 | History

Automata, computability and complexity

theory and applications

  • 0 Ratings
  • 3 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Language
English
Pages
1099

Buy this book

Edition Availability
Cover of: Automata, computability and complexity
Automata, computability and complexity: theory and applications
2008, Pearson Prentice Hall
in English

Add another edition?

Book Details


Published in

Upper Saddle River, N.J

Table of Contents

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

Edition Notes

Includes bibliographical references and index.

Classifications

Library of Congress
QA267 .R53 2008

The Physical Object

Pagination
xx, 1099 p. :
Number of pages
1099

ID Numbers

Open Library
OL24385141M
ISBN 10
0132288060
ISBN 13
9780132288064
LCCN
2010275411
OCLC/WorldCat
184990945

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
April 26, 2023 Edited by OnFrATa merge authors
October 21, 2010 Created by ImportBot Imported from Library of Congress MARC record.