But the dfa of this lang 0*1*2* has 4 final state and 1 trap state.

The Gateway to Computer Science Excellence

+7 votes

Best answer

0

@dexter bt this concept is used when we convert epsilon nfa to nfa ......bt here we r converting eps NFA to DFA.......

+2

In case of Nfa final state q0,q1,q2

but given is Dfa so final state should be

q0,q2,[q1,q2],[q0,q1,q2]

please guide if i am wrong

but given is Dfa so final state should be

q0,q2,[q1,q2],[q0,q1,q2]

please guide if i am wrong

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,297 answers

198,262 comments

104,976 users