Theory of Computation: A Problem-Solving Approach
Description
This book presents the core ideas in the difficult subject of the Theory of Computation in a clear and simple language so that students are not lost in obscure formalisms. It combines contemporary examples with effective pedagogy through a problem-solving, rather than a theorem-proving approach. We need many more such high-quality textbooks to improve the quality of engineering education in India.
Related Resources
Table of Contents
· Computers And The Science Of Computing
· Automata
· Non-Deterministic Finite Automata
· Regular Languages And Expressions
· Grammars
· Nature Of Regular Languages
· Context-Free Languages And Grammars
· Pushdown Automata
· Nature Of Context-Free Languages
· Turing Machines
· The Chomsky Hierarchy
· Computability And Undecidability
Epilogue
Appendix A A Formal Language Quiz
Appendix B Theorems
Further Reading
Glossary
Index