GATE - Iconic Pro
Free courses
CS & IT
Theory of Computation
Lesson 4 of 6 • 3 upvotes • 14:44mins
In this lesson, Shubham has discussed the examples of Deterministic Finite Automata
6 lessons • 1h 18m
Introduction to Theory of Computation
11:39mins
DFA Examples and Transition Table Part 1
14:50mins
DFA Examples and Transition Table Part 2
11:10mins
DFA Examples and Transition Table Part 3
14:44mins
NFA to DFA Examples and Complementation of NFA
14:30mins
Moore and Mealy Machine
11:55mins