1,121 views

4 Answers

1 votes
1 votes
Answer is B

We can eliminate A as this e-NFA accepts 10

We can eliminate C as Epselon is not in this language which is accepted by above e-NFA

Since Strings generated by language B are {e,0,1,00,01,10,11....}, which contains all strings accepted by e-NFA machine mentioned above.

Question is about what is the actual language accepted by e-NFA aove.

Not like which of these languages accepted by NFA.
0 votes
0 votes

Wrong Options

according to me in place of none of these 

All of these will be there

then all of these option will be correct

0 votes
0 votes
I think answer is none of these as this automata accepts all strings starting with zero which is not represented by any RE here

Related questions

0 votes
0 votes
1 answer
1
Deepalitrapti asked Jun 6, 2019
270 views
0 votes
0 votes
1 answer
2
0 votes
0 votes
1 answer
3
Souvik33 asked Nov 7, 2022
351 views
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110
0 votes
0 votes
0 answers
4