Ebook Info
- Published: 2010
- Number of pages: 448 pages
- Format: PDF
- File Size: 3.29 MB
- Authors: John Martin
Description
Introduction to Languages and the Theory of Computation helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. The book’s organization and the author’s ability to explain complex topics clearly make this introduction to the theory of computation an excellent resource for a broad range of upper level students. The author has learned through many years of teaching that the best way to present theoretical concepts is to take advantage of the precision and clarity of mathematical language. In a way that is accessible to students still learning this language, he presents the necessary mathematical tools gently and gradually which provides discussion and examples that make the language intelligible.
User’s Reviews
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐The book reads as follows for every section.A short introduction foreshadowing what is to be learned.Then theorems are introduced with two to three examples.One of the examples usually has an application in mind.Rinse and repeat.This is exactly how a mathematical textbook should be written.No fluff just math. Examples are given with pure mathematic and applied.The book’s style reminds me of
⭐.So many textbooks go for page count which leads to a lot of tangents.I recommend it.It does expect you know about set theory.This book would follow a computer science discrete math class.
⭐Reasonably well written book but it is very dense at times.
⭐Pages and pages of mumbo jumbo theoretical mathematical notation that is essentially worthless. Dead ideas from the early twentieth century when mathematicians were trying to define what computing was – but without actual computers. Made up nonsense with no grounds in reality. The author should be ashamed of himself for bringing this book into existence.
⭐This is not an introductory text; I would greatly suggest sipser’s book for a more organized and developed introduction to these topics. This assumes you’re well versed in formal proofs and have already worked with formal languages. Would make a great desktop reference, but definitely not an introduction to these topics.
⭐It’s a very self explanatory book with lot of examples.Examples indeed helps a lot in understanding the matter well
⭐Excellent quality book.
⭐Not exactly an easy read. It’s one of those text books that CONSTANTLY makes references to paragraphs, examples an theorems only by a number and doesn’t provide any clues to what the hell that thing was about. E.g. in section 2.3 “The finite automaton M in Example 2.1 […]” (from 11 pages earlier) and “[…] and it will provide the answer to the first question we asked in the first paragraph”. This means that I’m flipping pages all the time to find out what the hell exactly is being referred to and it’s a total motivation killer.
Keywords
Free Download Introduction to Languages and the Theory of Computation 4th Edition in PDF format
Introduction to Languages and the Theory of Computation 4th Edition PDF Free Download
Download Introduction to Languages and the Theory of Computation 4th Edition 2010 PDF Free
Introduction to Languages and the Theory of Computation 4th Edition 2010 PDF Free Download
Download Introduction to Languages and the Theory of Computation 4th Edition PDF
Free Download Ebook Introduction to Languages and the Theory of Computation 4th Edition