Please Login To Continue

Questions on Minimization of DFA - Part 2 (in Hindi)

Lesson 18 of 29 • 0 upvotes • 12:24mins

Avatar

Shivam Pandey

In this lesson we Solved a question on Minimization Of DFA.

Continue on app
1

DFA Which Accepts String that Starts with W (in Hindi)

8:10mins

2

DFA Which Accepts String that Ends with W (in Hindi)

9:00mins

3

DFA Which Accepts String that Must Contain W (in Hindi)

8:48mins

4

DFA Which Accepts String that Starts and Ends with 'A' (in Hindi)

7:05mins

5

DFA Which Accepts String that Start and Ends with Same Symbol (in Hindi)

9:16mins

6

DFA That Accepts Every String Starting with 'aa' and 'bb' (in Hindi)

7:20mins

7

DFA That Accepts Every String Ending with 'aa' or 'bb' (in Hindi)

8:02mins

8

DFA That Accepts String that Contains Substring 'aa' or 'bb' (in Hindi)

7:15mins

9

DFA That Accepts Every String Such That |W|=n (in Hindi)

9:20mins

10

DFA That Accepts String Containing Substring |W|a=n (in Hindi)

8:56mins

11

DFA That Accepts Every String Such That |W|= r(mod n) (in Hindi)

9:18mins

12

DFA That Accepts Every String which Contains Odd Occurence of Substring 'ab' (in Hindi)

8:34mins

13

DFA That Accepts Every String Starting with 'ab' and |W|=3mod4 (in Hindi)

9:26mins

14

DFA That Accepts Every String Such That |W|0=0 (mod 2) and |W|=1(mod 2) (in Hindi)

10:46mins

15

DFA That Accepts Every String That Does Not Contain Substring 'abb' (in Hindi)

9:20mins

16

Minimization of DFA (in Hindi)

9:23mins

17

Questions on Minimization of DFA - Part 1 (in Hindi)

10:33mins

18

Questions on Minimization of DFA - Part 2 (in Hindi)

12:24mins

19

Question on Minimization of DFA - Part 3 (in Hindi)

9:03mins

20

NFA That Accepts Every String That Starts with: (i) abX (ii) baaX

9:00mins

21

NFA That Accepts Every String That Ends with: (i) Xab (ii) Xbaa

8:41mins

22

NFA That Accepts Every String That Contains a Substring: (i) XaaX (ii) XabbX

9:40mins

23

NFA That Accepts Every String That Starts and Ends With A

8:07mins

24

NFA That Accepts Every String That Starts and Ends With Same Symbol

8:24mins

25

NFA that accepts every string that Have Atleast Two Consecutive 1's or 0's

8:49mins

26

NFA To DFA Conversion Part 1

13:49mins

27

NFA to DFA Conversion Part 2

10:27mins

28

NFA to DFA Conversion Part 3

9:55mins

29

NFA to DFA Conversion Part - 4.

12:15mins

Crack GATE - Iconic Pro with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

Similar Plus Courses

thumbnail
ENROLL
HinglishPsychology

Complete Course on Development & Disorders - NET/SET/GATE & Clinical Psychology

Hafsa Malik

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app