A Handbook of Theory of Computation
N.B. Singh
This audiobook is narrated by a digital voice.
"A Handbook of Theory of Computation" is a comprehensive guide designed for absolute beginners seeking to delve into the captivating world of theoretical computer science. Tailored to provide a gentle introduction to complex concepts, this book offers a curated collection of fundamental theories, principles, and formulas in automata theory, formal languages, complexity theory, and more. Through clear explanations and illustrative examples, readers will navigate topics such as finite automata, regular expressions, context-free grammars, Turing machines, and computational complexity with ease. With a focus on accessibility and practical relevance, this handbook equips readers with the foundational knowledge and tools necessary to understand and analyze computational systems, laying the groundwork for further exploration and discovery in the dynamic field of computer science.
Duration - 2h 5m.
Author - N.B. Singh.
Narrator - Digital Voice Mary G.
Published Date - Monday, 20 January 2025.
Copyright - © 2024 N.B. Singh ©.
Location:
United States
Description:
This audiobook is narrated by a digital voice. "A Handbook of Theory of Computation" is a comprehensive guide designed for absolute beginners seeking to delve into the captivating world of theoretical computer science. Tailored to provide a gentle introduction to complex concepts, this book offers a curated collection of fundamental theories, principles, and formulas in automata theory, formal languages, complexity theory, and more. Through clear explanations and illustrative examples, readers will navigate topics such as finite automata, regular expressions, context-free grammars, Turing machines, and computational complexity with ease. With a focus on accessibility and practical relevance, this handbook equips readers with the foundational knowledge and tools necessary to understand and analyze computational systems, laying the groundwork for further exploration and discovery in the dynamic field of computer science. Duration - 2h 5m. Author - N.B. Singh. Narrator - Digital Voice Mary G. Published Date - Monday, 20 January 2025. Copyright - © 2024 N.B. Singh ©.
Language:
English
Preface
Duration:00:01:39
Introduction
Duration:00:00:03
Overview of Theory of Computation
Duration:00:06:48
Importance in Computer Science
Duration:00:02:09
Finite Automata
Duration:00:00:03
Basics of Finite Automata
Duration:00:01:41
Deterministic Finite Automata (DFA)
Duration:00:03:27
Nondeterministic Finite Automata (NFA)
Duration:00:07:13
Regular Languages
Duration:00:00:03
Regular Expressions
Duration:00:07:27
Regular Grammar
Duration:00:07:38
Pumping Lemma for Regular Languages
Duration:00:04:13
Context-Free Grammars
Duration:00:00:03
Basics of Context-Free Grammars
Duration:00:06:27
Chomsky Hierarchy
Duration:00:08:26
Pushdown Automata
Duration:00:07:35
Turing Machines
Duration:00:00:03
Introduction to Turing Machines
Duration:00:06:33
Turing Machine Formalism
Duration:00:02:41
Turing Machine Variants
Duration:00:04:47
Halting Problem
Duration:00:01:45
Undecidability and Intractability
Duration:00:00:05
Decidability and Recognizability
Duration:00:06:41
Formal Languages and Automata
Duration:00:00:04
Properties of Regular and Context-Free Languages
Duration:00:06:05
Decision Properties
Duration:00:04:19
Advanced Topics
Duration:00:00:03
Computability Theory
Duration:00:05:18
Complexity Theory
Duration:00:05:54
Conclusion
Duration:00:00:39
Appendix
Duration:00:00:03
Useful Formulas
Duration:00:04:54
Additional Resources
Duration:00:04:17