555 views

2 Answers

2 votes
2 votes
δ*(qi,w)= qj

qj= set of all possible States the automata maybe in, having started in state qi  and having read w.
1 votes
1 votes
1){ q0,q1} 1010 string accepted by nfa

2) {q2}      00 come to dead configuration starting from state q1

Related questions

1 votes
1 votes
1 answer
1
Prajwal Bhat asked Jul 9, 2016
4,563 views
Find a DFA for the following language on {a,b}L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }
2 votes
2 votes
1 answer
2
Prajwal Bhat asked Jul 9, 2016
4,805 views
Find a DFA for the following language on {a,b}L = { w : ( na(w) - nb(w)) mod 3 >0 }
0 votes
0 votes
0 answers
3
Pawan Kumar 2 asked Sep 9, 2017
458 views
I'm not getting where I'm wrong but the correct answer is first one . Kindly correct me plz Thanks :) sorry for the bad handwriting thoughGiven below is the question...
1 votes
1 votes
1 answer
4
Pawan Kumar 2 asked Sep 4, 2017
605 views
I'm able to convert a NFA into DFA without this lambda transition , but not with this ... How do I convert it into DFA?