McqMate

Q. |
## Any Language generated by an unrestricted grammar is: |

A. | Recursive |

B. | Recursively Enumerable |

C. | Not Recursive |

D. | None of the above |

Answer» A. Recursive |

939

0

Do you find this helpful?

11

View all MCQs in

Theory of ComputationNo comments yet

- Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.
- 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:
- Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
- Which of the following strings is not generated by the following grammar? S → SaSbS ε
- Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
- Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
- The …………. is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree .
- If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by Select correct option:
- 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 :
- Which of the following is true with respect to Kleene’s theorem? 1 A regular language is accepted by a finite automaton. 2 Every language is accepted by a finite automaton or a turingmachine.