McqMate

Q. |
## Which of the following strings is not generated by the following grammar? S → SaSbS ε |

A. | aabb |

B. | abab |

C. | aababb |

D. | aaabb |

Answer» D. aaabb |

3.2k

0

Do you find this helpful?

12

View all MCQs in

Theory of ComputationNo comments yet

- Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ such that all the strings of the form XY^ n Z for n=1,2,3, … are the words in L called
- Consider the following statements about the context free grammar G = {S - >SS,S - >ab,S ->ba, S - ε} I. G is ambiguous II. G produces all strings with equal number of a’s and b’s III. G can be accepted by a deterministic PDA. Which combination below expresses all the true statements about G?
- Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
- All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:
- Any Language generated by an unrestricted grammar is:
- A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
- Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :
- Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
- The regular expression have all strings in which any number of 0’s is followed by any number of 1’s followed by any number of 2’s is :
- Two strings x and y are indistinguishable if: