Please Login To Continue
Check regularity of a language very important (in Hindi)
Lesson 11 of 11 • 2 upvotes • 8:24mins
Varsha Agarwal
Discuss how to check regularity of a language
(Hindi) Non Deterministic Finite Automata (NFA) : NTA-UGC NET
11 lessons • 1h 24m
1
Introduction of Course NFA and FA with Output (in Hindi)
3:20mins
2
Definition of NFA AND Different Between NFA and DFA (in Hindi)
8:05mins
3
Designing of NFA Part 1 (in Hindi)
8:08mins
4
Designing of NFA Part 2 for NTA NET (in Hindi)
8:00mins
5
Designing of NFA Part 3 for NTA NET (in Hindi)
8:50mins
6
Discuss € clouser in detail for NTA NET(IN HINDI)
7:07mins
7
Convert NFA TO DFA (IN HINDI)
8:38mins
8
Convert NFA TO DFA part 2(IN HINDI)
8:06mins
9
Convert € NFA TO DFA PART 3 (IN HINDI)
7:23mins
10
Myhill nerode theorem for regular language(in hindi)
8:15mins
11
Check regularity of a language very important (in Hindi)
8:24mins
Crack NTA-UGC-NET & SET Exams with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
