Introduction to automata theory, languages, and computation

4.0 avg 673 votes 32 reviews 2114 want to read

About this book

"This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--BOOK JACKET.

4.0 ★★★★☆ average of 2 sources · 673 votes
Open Library 4.5 2
Goodreads 4.0 673
1★2★3★4★5★

32 reviews · 2,114 want to read · 79 reading now

Reader Profile

Enjoyment81Difficulty60Influence0Popularity41Classic47

4.0/5 · 673 readers · 524 pages · ≈ 9 h 42 m · Moderate

How long does it take to read Introduction to automata theory, languages, and computation?

About ≈ 9 h 42 m — 524 pages, assuming roughly 250 words per page at 225 words per minute.Typical novel≈ 5 h 56 mIntroduction to automata theory, languages, and computation~9 h 42 m

How many pages is Introduction to automata theory, languages, and computation?

524 pages in its most-read edition.Typical novel320Introduction to automata theory, languages, and computation524

Is Introduction to automata theory, languages, and computation in the public domain?

No — it is still under copyright.

Who wrote Introduction to automata theory, languages, and computation?

John E. Hopcroft (1939–0).

Introduction to automata theory, languages, and computation ★ 4.0 · 2 sources Check price →