McqMate

Q. |
## Which one of the following statement is FALSE? |

A. | context-free languages are closed under union |

B. | context-free languages are closed under concatenation |

C. | context-free languages are closed under intersection |

D. | context-free languages are closed under Kleene closure |

Answer» C. context-free languages are closed under intersection |

3.8k

0

Do you find this helpful?

25

View all MCQs in

Theory of ComputationNo comments yet

- Which of the following statement is false for a turing machine?
- 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.
- Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states?
- Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet Σ?
- Which of the following statement is wrong?
- In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”
- Which of the following statement is wrong?
- Which of the following statement is wrong?
- 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 statement is true?