The third edition of Languages and Machines An Introduction to the Theory of Computer Science provides readers with a mathematically sound presentation of the theory of computer science The theoretical concepts and associated mathematics are made accessible by a learn as you go approach that develops an intuitive understanding of the concepts through numerous examples and illustrations....
|Title||:||Languages And Machines: An Introduction To The Theory Of Computer Science|
|Publisher||:||Pearson Auflage 3 18 Februar 2005|
|Number of Pages||:||654 Seiten|
|File Size||:||597 KB|
|Status||:||Available For Download|
|Last checked||:||21 Minutes ago!|
Languages And Machines: An Introduction To The Theory Of Computer Science Reviews
Languages and Machines has all the definitions of other automata theory texts, however the examples and problem sets leave something to be desired. My students could not solve the problems because the examples in no way relate to the problem sets. In fact, the examples are just statements designed to help with the understanding of definitions. Students like to see how problems are solved. My stundents screamed for the form Question-Answer in the text. This book does not deliver. I spent the majority of my lectures doing examples instead of lecturing on theory. Also with notation differences from traditional Discrete Mathematics texts and errata in a few key definitions, my students were glad to be seniors...as they probably will never have to see this text again. In short, a very disappointing second edition. I expected better.
This is one of the better books that I read on languages and machines. This book is great for someone who is interested in parsing, compilers or pattern matching. The book covers a lot of theory on computation and is not for a beginner. I would recommend that one be well grounded in set theory, recursion and mathematical induction before attempting to read this book. I did not read all the chapters; I only read those that were relevant to my project and I had not seen before in other texts. The 1st chapter get you upto speed with a good review of set theory followed by a quick review of induction and recursion. The 2nd chapter gives an excellent introduction to strings, languages and regular expressions along with relations on regular expressions. Chapter 3 is where the rubber hits the road. It covers context-free and regular grammars. I feel this chapter covers the subjects very well. Chapter 4 gives a good description of parsing and methods of parsing. Chapter 6 covers Finite Automata. This chapter describes deterministic finite state machines, nondeterministic finite state matchines and nondeterministic finite state matchines with lambda transitions. The presentation of the subject in this chapter was excellent. Chapter 7 presents Regular Languages and Sets. This chapter gives a good presentation of how to put together different types of machines from different languages and build languages from machines. I found it best not to read the chapters in orders, instead I read them in the following order which helped to understand the material better; 1,2,6,7,3,4,11,12My only complaint: It would have helped if the author could have gave answers to some of the problems at the end of the chapters.
I have a mathematical background and wished to acquaint myself with the basics of theoretical computer science. This book didn't disappoint me.The book stresses formal languages and parsing, and is therefore best suited for persons interested in creating languages, compiler technology and parsing. However, it covers also Turing machines, computability and complexity issues, among others, and is therefore reasonably comprehensive.Exercises range from easy to moderate, and many of them are stimulating. Another reviewer complained about the lack of drill exercises (see below). I can understand the anguish of students; some of the exercises, as well as parts of the text, may be difficult if one doesn't have much experience in formal reasoning and abstract problem solving. However, all exercises I have taken a look at are solvable with the knowledge provided in the text, and are therefore suitable for readers with at least a fair mathematical background.My main complaint is the small number of applications. In chapter 3, there is a nice example: the arithmetic expressions of Pascal; in chapter 15, good examples of NP-complete problems. However, these are exceptions. In my opinion the text would greatly benefit from e.g. end-of-chapter exercises related to programming mini-languages which could be defined on the spot. Also examples of finite state machines (copier machines, services in a mobile phone etc.) would add flesh to exercises.All in all, this is a good entry point to theoretical computer science for a person trained in mathematics or a related field, but may partly be too challenging to a first-year student.
This is a tough book. The book is a great resource to utilize, but there are a distinct lack of examples. You'll absolutely need to supplement this book with something else--educational videos online are a great resource.I used this book in a Theory class, and it was really difficult. Going from DFAs to NFAs to PDAs were pretty simple, but the jump to Turing Machines was incredibly difficult... I had trouble learning it from this book and had to find other places.If my teacher did not assign problems from the book, I would not have not have bought it. I don't think it impacted how I learned the subject in any way, so save your money if it's an optional buy.
I love the price, and the quality was great!Shipped on time, and the book was in lovely condition.The book itself... if you don't have an instructor to do examples it's terrible. Or just have an instructor who doesn't do examples well either.A bunch of theory, very little in the way of examples to help you solve the problems at the end of every chapter.The best way to learn this stuff is with lots of example problems, and working a lot of similar problems.You'll want to pair this with the solution manual to have a chance at getting some examples similar to the problems your instructor will assign.
Speaking solely of the quality of the physical book, it's worth nothing close to what I paid. The first one I got had dents in the sides of the pages and the front cover was too long (not cut to length). The replacement was only slightly less damaged, and the front cover was just as poorly cut, but the pages curved out to meet it as well. If you can't cut paper well for $130, what are you doing selling books?
Great product at a great price. Would buy from again.