Sinopsis
Judging from the email communications that I've received from so many of you, the biggest deficiency of the first edition is that it provides no sample solutions to any of the problems. So here they are. Every chapter now contains a new Selected Solutions section that gives answers to a representative cross-section of that chapter's exercises and problems. To make up for the loss of the solved problems as interesting homework challenges, I've also added a variety of new problems. Instructors may request an Instructor's Manual that contains additional solutions by contacting the sales representative for their region designated at www. course. comn.
A number of readers would have liked more coverage of certain "standard" topics, particularly the Myhill-Nerode Theorem and Rice's Theorem. I've partially accommodated these readers by developing these topics in the solved problems. I did not include the Myhill-Nerode Theorem in the main body of the text because I believe that this course should provide only an introduction to finite automata and not a deep investigation.
Content
- Introduction
- Automata and Languages
- Regular Languages
- Context-Free Languages
- Computability Theory
- The Church-Turing Thesis
- Decidability
- Reducibility
- Advanced Topics in Computability Theory
- Complexity Theory
- Time Complexity
- Space Complexity
- Intractability
- Advanced topics in complexity theory
,+A+-+Stroustrup,+Bjarne.jpg)
.jpg){kind=spacer}
0 komentar:
Posting Komentar