This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

An Introduction to Formal Languages & Automata provides an excellent presentation of the material that is essential to an introductory theory of computation course. The text was designed to familiarize students with the foundations & principles of computer science & to strengthen the students' ability to carry out formal & rigorous mathematical argument. Employing a problem-solving approach, the text provides students insight into the course material by stressing intuitive motivation & illustration of ideas through straightforward explanations & solid mathematical proofs. By emphasizing learning through problem solving, students learn the material primarily through problem-type illustrative examples that show the motivation behind the concepts, as well as their connection to the theorems & definitions.

A compiler translates a program written in a high level language into a program written in a lower level language. For students of computer science, building a compiler from scratch is a rite of passage: a challenging and fun project that offers insight into many different aspects of computer science, some deeply theoretical, and others highly practical. This book offers a one semester introduction into compiler construction, enabling the reader to build a simple compiler that accepts a C-like language and translates it into working X86 or ARM assembly language. It is most suitable for undergraduate students who have some experience programming in C, and have taken courses in data structures and computer architecture.

Compilers and operating systems constitute the basic interfaces between a programmer and the machine for which he is developing software. In this book we are concerned with the construction of the former. Our intent is to provide the reader with a firm theoretical basis for compiler construction and sound engineering principles for selecting alternate methods, imple menting them, and integrating them into a reliable, economically viable product. The emphasis is upon a clean decomposition employing modules that can be re-used for many compilers, separation of concerns to facilitate team programming, and flexibility to accommodate hardware and system constraints. A reader should be able to understand the questions he must ask when designing a compiler for language X on machine Y, what tradeoffs are possible, and what performance might be obtained. He should not feel that any part of the design rests on whim; each decision must be based upon specific, identifiable characteristics of the source and target languages or upon design goals of the compiler. The vast majority of computer professionals will never write a compiler. Nevertheless, study of compiler technology provides important benefits for almost everyone in the field . • It focuses attention on the basic relationships between languages and machines. Understanding of these relationships eases the inevitable tran sitions to new hardware and programming languages and improves a person's ability to make appropriate tradeoft's in design and implementa tion .

Provides an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability. This book also includes an introduction to computational complexity and NP-completeness.

This Book Is Aimed At Providing An Introduction To The Basic Models Of Computability To The Undergraduate Students. This Book Is Devoted To Finite Automata And Their Properties. Pushdown Automata Provides A Class Of Models And Enables The Analysis Of Context-Free Languages. Turing Machines Have Been Introduced And The Book Discusses Computability And Decidability. A Number Of Problems With Solutions Have Been Provided For Each Chapter. A Lot Of Exercises Have Been Given With Hints/Answers To Most Of These Tutorial Problems.