McqMate

Q. |
## Which of the following statements is wrong? |

A. | The regular sets are closed under intersection |

B. | The class of regular sets is closed under substitution |

C. | The class of regular sets is closed under homomorphism |

D. | Context Sensitive Grammar(CSG) can be recognized by Finite State Machine |

Answer» D. Context Sensitive Grammar(CSG) can be recognized by Finite State Machine |

2.4k

0

Do you find this helpful?

28

View all MCQs in

Theory of ComputationNo comments yet

- 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?
- Which of the following statement is wrong?
- Which of the following statement is wrong?
- Which of the following statement is wrong?
- Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the computation of M on w visit the state q? Which of the following statements about x is correct?
- Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?
- Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
- Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?
- Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
- Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.