My Account Log in

2 options

Finite automata, formal logic, and circuit complexity / Howard Straubing.

Math/Physics/Astronomy Library QA76.9.M35 S77 1994
Loading location information...

Available This item is available for access.

Log in to request item
LIBRA QA76.9.M35 S77 1994
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Author/Creator:
Straubing, Howard, 1952-
Series:
Progress in theoretical computer science
Language:
English
Subjects (All):
Computer science--Mathematics.
Computer science.
Machine theory.
Logic, Symbolic and mathematical.
Computational complexity.
Physical Description:
xiii, 226 pages ; 24 cm.
Place of Publication:
Boston : Birkhäuser, [1994]
Notes:
Includes bibliographical references (pages 217-222).
Includes index.
ISBN:
0817637192
OCLC:
29024667

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account