Course module
Theory of Computation — Bihar Polytechnic Lecturer (Computer Science)
Explore the module outline and lessons below. Enroll free to begin studying here.
Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/theory-of-computation after enrolling
- Lessons
- 65
- Duration
- 4 hr 41 min
- PYQs
- 0
- Practice
- 136
Syllabus index
Lessons in this module
Grammar
Chomsky & Basics
Grammar Design via Regex
- Grammar Design via RegexPdf
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Grammar Design form Regular Expression part-1Drm Video
- Grammar Design form Regular Expression part-2Drm Video
- Regular grammar to regular expressionDrm Video
- Regular grammar to regular expressionDrm Video
Regular Language Properties
Decidability & Basics
Closure Properties
Pumping Lemma
Moore & Mealy Machines
Basics & Moore Machine
Turing Machines
TM Basics & Design
- TM Basics & DesignPdf
- Fundamentals of Turing MachineDrm Video
- Formal Defination of Turing machine with componentsDrm Video
- Turing Machine Design Practice Problem Part-1Drm Video
- Turing Machine Design Practice Problem Part-2Drm Video
- Turing Machine Design Practice Problem Part-3_Drm Video
- Adding Two Unary NumberDrm Video
- Converting Unary to BinaryDrm Video
- Turing Machine_Practice Questions_1Drm Video
- Halting ProblemDrm Video
TM Variations & UTM
Decision Properties
Linear Bounded Automata
Explore the course
- Discrete Mathematics
- Digital Logic
- Computer Organization and Architecture
- Programming
- Data Structures
- Algorithms
- Compiler Design
- Operating Systems
- Database Management Systems
- Computer Networks