Please Login To Continue
Kleen Closure And Positive Closure(in Hindi)
Lesson 3 of 12 • 30 upvotes • 14:33mins
Priyanka Bhati
This lesson explains kleen closure and positive closure
(Hindi) Finite Automata (TOC) for GATE CS and IT
12 lessons • 2h 20m
1
Introduction to TOC (in Hindi)
6:47mins
2
Operation On Strings (in Hindi)
12:50mins
3
Kleen Closure And Positive Closure(in Hindi)
14:33mins
4
DFA(Deterministic Finite Automata)(in Hindi)
14:37mins
5
Types Of States In DFA(Productive And Non Productive)(in Hindi)
11:56mins
6
Steps To Draw DFA (in Hindi)
13:00mins
7
Drawing Complex DFA(in Hindi)
10:18mins
8
Non Deterministic Finite Automata (NFA) (in Hindi)
11:43mins
9
How To Draw NFA (in Hindi)
10:54mins
10
NFA to DFA (in Hindi)
11:28mins
11
Null NFA (in Hindi)
9:55mins
12
DFA minimization (in Hindi)
12:01mins
Crack GATE & ESE with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
