Stock photo
Stock photo
Addison-Wesley Series in Computer Science and Information Processing: Introduction to Automated Theory, Languages, and Computation by Jeffrey D. Ullman and John E. Hopcroft (1979, Hardcover)
ThriftBooks (3879079)
99% positive Feedback
Price:
US $10.91
Approximately£8.14
+ $15.10 postage
Returns:
Condition:
An Introduction to Automata Theory, Languages, and Computation by Hopcroft, John E. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less
- Buy it nowAn Introduction to Automata Theory, Languages, and Computation
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherAddison-Wesley Longman, Incorporated
ISBN-10020102988X
ISBN-139780201029888
eBay Product ID (ePID)17038267974
Product Key Features
Number of Pages500 Pages
LanguageEnglish
Publication NameIntroduction to Automated Theory, Languages, and Computation
Publication Year1979
SubjectProgramming Languages / General, Machine Theory
TypeTextbook
Subject AreaComputers
AuthorJeffrey D. Ullman, John E. Hopcroft
SeriesAddison-Wesley Series in Computer Science and Information Processing
FormatHardcover
Dimensions
Item Height0.8 in
Item Weight24.1 Oz
Item Length9.5 in
Item Width6.5 in
Additional Product Features
Edition Number1
Intended AudienceCollege Audience
LCCN78-067950
Dewey Edition19
IllustratedYes
Dewey Decimal001.53/5
Table Of ContentPreliminaries. Finite Automata and Regular Expressions. Properties of Regular Sets. Context-Free Grammars. Pushdown Automata. Properties of Context-Free Languages. Turing Machines. Undecideability. The Chomsky Hierarchy. Deterministic Context-Free Languages. Closure Properties of Families of Languages. Computational Complexity Theory. Intractable Problems. Highlights of Other Important Language Classes. Bibliography. Index.
SynopsisThis book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars. 020102988XB04062001, This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
LC Classification NumberQA267
All listings for this product
Ratings and reviews
Most relevant reviews
- 12 May, 2020
Book arrived promptly, and is free from highlighting.
Book arrived promptly, and is free from highlighting.Verified purchase: YesCondition: Pre-owned
