Register

ISRO2015-43

• retagged by
4,174 views
10 10 votes

Let $R_1$ and $R_2$ be regular sets defined over the alphabet, then

  1. $ R_1 \cap R_2$ is not regular
  2. $R_1 \cup R_2$ is not regular
  3. $\Sigma^* - R_1$ is regular
  4. $R_1^*$ is not regular

3 Answers

Best answer
10 10 votes
option C is correct

Regular sets are closed under union, intersection, complement, and kleen closure

But regular sets are not closed under infinite union
• selected by
1 1 vote

"Regular languages are closed under Intersection, Union ,Kleens Closure ,Compliment"

According to this point option C is perfect

Voting & Accepting an answer helps improve the community
Answer:
← Previous · ISRO2015-39Next → · ISRO2015-45
← Previous in category · TM DecidablityNext in category → · NFA DFA
Position:
Show:

Related questions

20 20 votes
2 answers 2 answers
9.1k
9.1k views
go_editor asked Jun 21, 2016
9,136 views
ISRO2015-80
Consider the following code fragmentvoid foo(int x, int y) { x+=y; y+=x; } main() { int x=5.5; foo(x,x); }What is the final value of $\textsf{x}$ in both call by value an...
11 11 votes
5 answers 5 answers
10.2k
10.2k views
go_editor asked Jun 21, 2016
10,171 views
ISRO2015-75
The for loopfor (i=0; i<10; ++i) printf("%d", i&1);prints0101010101011111111100000000001111111111
11 11 votes
4 answers 4 answers
12.5k
12.5k views
go_editor asked Jun 21, 2016
12,487 views
ISRO2015-73
The output of the following program ismain() { static int x[] = {1,2,3,4,5,6,7,8} int i; for (i=2; i<6; ++i) x[x[i]]=x[i]; for (i=0; i<8; ++i) printf("%d", x[i]); }1 2 3 ...
9 9 votes
2 answers 2 answers
10.8k
10.8k views
go_editor asked Jun 21, 2016
10,769 views
ISRO2015-71
Consider the following program fragmenti=6720; j=4; while (i%j)==0 { i=i/j; j=j+1; }On termination j will have the value4896720