- Computer Science Engineering (CSE)
- Theory of Computation
- Unit 1
- Which of the following is TRUE?

Q. |
## Which of the following is TRUE? |

A. | Every subset of a regular set is regular |

B. | Every finite subset of a non-regular set is regular |

C. | The union of two non-regular sets is not regular |

D. | Infinite union of finite sets is regular |

Answer» B. Every finite subset of a non-regular set is regular |

View all MCQs in:
Theory of Computation

- 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.”
- = ∈{ } w has at least as many occurrences of (110)’s as (011)’s}. Let L {w 0,1 * 2 = ∈{ } w has at least as many occurrence of (000)’s as (111)’s}. Which one of the following is TRUE?
- 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.
- 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?
- Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states?
- Which of the following regular expression identity 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?
- Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
- Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is 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?

Login to Continue

It will take less than 2 minutes

Report MCQ