An Introduction to Formal Languages and 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 and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical argument. Employing a problem-solving approach, the text provides students insight into the course material by stressing intuitive motivation and illustration of ideas through straightforward explanations and solid mathematical proofs. By emphasizing a 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 and definitions
No comments:
Post a Comment