• edited by
13,226 views
26 26 votes

Let $R_{1}$ and $R_{2}$ be regular sets defined over the alphabet $\Sigma$ Then:

  1. $R_{1} \cap R_{2}$ is not regular.
  2. $R_{1} \cup R_{2}$ is regular.
  3. $\Sigma^{*}-R_{1}$ is regular.
  4. $R_{1}^{*}$ is not regular.

2 Answers

Best answer
46 46 votes

Regular Languages are closed under

  1. Intersection
  2. Union
  3. Complement
  4. Kleen-Closure

$\Sigma^∗−R_1$ is the complement of $R_1$
 

Correct Options: B;C

• edited by
7 7 votes
  1. R1 ∩ R2 is not regular.-FALSE,Regular sets are closed under Intersection
  2. R1 ∪ R2 is regular. TRUE,Regular sets are closed under Union
  3. ∑∗−R1 is regular,TRUE,Regular sets are closed under Complement
  4. R1* is not regular.FALSE,Regular sets are closed under Intersection
Answer:
Position:
Show:

Related questions

32 32 votes
2 answers 2 answers
10.6k
10.6k views
Misbah Ghaya asked Nov 19, 2016
10,638 views
The number of rooted binary trees with $n$ nodes is,Equal to the number of ways of multiplying $(n+1)$ matrices.Equal to the number of ways of arranging $n$ out of $2 n$ ...
57 57 votes
4 answers 4 answers
22.0k
22.0k views
Misbah Ghaya asked Nov 22, 2016
22,006 views
It is undecidable whether:An arbitrary Turing machine halts after $100$ steps.A Turing machine prints a specific letter.A Turing machine computes the products of two numb...
36 36 votes
3 answers 3 answers
23.6k
23.6k views
Misbah Ghaya asked Nov 22, 2016
23,586 views
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...
25 25 votes
2 answers 2 answers
8.5k
8.5k views
Misbah Ghaya asked Nov 27, 2016
8,510 views
The condition for overflow in the addition of two $2's$ complement numbers in terms of the carry generated by the two most significant bits is ___________.