1,493 views
0 votes
0 votes

Given following NFA

find the minimal equivalent DFA

2 Answers

Best answer
1 votes
1 votes

ð(q,x)=epsilon-closure(ð(q,epsilon-closure(x)))

epsilon-NFA to NFA 

 

a b
1 123  
2 123 123
3 123 123

 

NFA to DFA

 

a b
1 *123 Dead
*123 *123 *123
Dead Dead Dead

123 is the final state.

selected by
0 votes
0 votes

the above nfa is equivalent to  a(a+b)* for further full solution  see the image on the link; https://ibb.co/HTBkRzc

edit: i have corrected my image link

edited by

Related questions

0 votes
0 votes
0 answers
1
Harshitha 123 asked Jun 12, 2018
402 views
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
1 votes
1 votes
1 answer
2
kislaya Pant asked May 8, 2018
1,063 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
1 votes
1 votes
1 answer
4