Normal view MARC view ISBD view

Theory of computation, formal languages, automata, and complesity

Brookshear Glenn J

Theory of computation, formal languages, automata, and complesity - California Benjamin/Cummings Publisher 1989 - 322p. cm. - Benjamin/ ummings series in computer science .

Standard No.: 273

Source: Textual

Subjects--Topical Terms:
Mathematics

Dewey Class. No.: B:(D65,8(B)), M9

Place hold
Print
Cite
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 ISBD
More searches

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