Please Login To Continue
Minimization Of DFA
Lesson 12 of 12 • 32 upvotes • 13:16mins
Priyanka Bhati
Minimization of DFA
Theory of Computation(TOC) - GATE 2019
12 lessons • 2h 9m
1
Introduction to TOC
4:35mins
2
Operations on Strings
11:31mins
3
Kleen Closure and Positive Closure
10:30mins
4
DFA (Deterministic Finite Automata)
10:56mins
5
Types of States in DFA (Productive and Non-Productive States)
10:24mins
6
Steps To Draw DFA (With Examples)
11:35mins
7
Drawing Complex DFA
13:08mins
8
NFA(Non Deterministic Finite Automata)
11:01mins
9
Steps To Draw NFA ( With Examples )
10:59mins
10
NFA To DFA ( With Examples )
12:01mins
11
Null NFA ( Epsilon NFA )
9:20mins
12
Minimization Of DFA
13:16mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
