378 views

1 Answer

1 votes
1 votes
  • state diagram M corresponds to DFA SO it will produce unambiguous grammer 
  • state diagram N corresponds to NFA so it will produce ambiguous grammer 

so B) option answer .

edited by

Related questions

0 votes
0 votes
2 answers
1
Pratik.patil asked Oct 30, 2023
369 views
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
2 votes
2 votes
1 answer
2
h4kr asked Dec 4, 2022
528 views
I don’t get the explanation, How do you categorize grammer on the basis of production?
2 votes
2 votes
1 answer
3
Souvik33 asked Nov 23, 2022
302 views
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE