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
Duración:00:01:39
Introduction
Duración:00:00:03
Overview of Theory of Computation
Duración:00:06:48
Importance in Computer Science
Duración:00:02:09
Finite Automata
Duración:00:00:03
Basics of Finite Automata
Duración:00:01:41
Deterministic Finite Automata (DFA)
Duración:00:03:27
Nondeterministic Finite Automata (NFA)
Duración:00:07:13
Regular Languages
Duración:00:00:03
Regular Expressions
Duración:00:07:27
Regular Grammar
Duración:00:07:38
Pumping Lemma for Regular Languages
Duración:00:04:13
Context-Free Grammars
Duración:00:00:03
Basics of Context-Free Grammars
Duración:00:06:27
Chomsky Hierarchy
Duración:00:08:26
Pushdown Automata
Duración:00:07:35
Turing Machines
Duración:00:00:03
Introduction to Turing Machines
Duración:00:06:33
Turing Machine Formalism
Duración:00:02:41
Turing Machine Variants
Duración:00:04:47
Halting Problem
Duración:00:01:45
Undecidability and Intractability
Duración:00:00:05
Decidability and Recognizability
Duración:00:06:41
Formal Languages and Automata
Duración:00:00:04
Properties of Regular and Context-Free Languages
Duración:00:06:05
Decision Properties
Duración:00:04:19
Advanced Topics
Duración:00:00:03
Computability Theory
Duración:00:05:18
Complexity Theory
Duración:00:05:54
Conclusion
Duración:00:00:39
Appendix
Duración:00:00:03
Useful Formulas
Duración:00:04:54
Additional Resources
Duración:00:04:17