edited by
6,620 views
23 votes
23 votes

Which of the following statements is false?

  1. Every finite subset of a non-regular set is regular
  2. Every subset of a regular set is regular
  3. Every finite subset of a regular set is regular
  4. The intersection of two regular sets is regular
edited by

3 Answers

Best answer
30 votes
30 votes

Correct Option: B

Any language is a subset of $\Sigma^*$ which is a regular set. So, if we take any non-regular language, it is a subset of a regular language.

(a) and (c) are regular as any finite language is regular.

(d) is regular as regular set is closed under intersection.

edited by
3 votes
3 votes
B is false because if u take a*b* as an example a^n b^n is a subset of a*b* but its not regular
–2 votes
–2 votes

(c) Every finite subset of a regular set is regular this is false

example:a^n b^n from regular set (a+b)* is not regular

Answer:

Related questions

9.4k
views
5 answers
29 votes
Arjun asked Oct 17, 2014
9,364 views
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
23.8k
views
7 answers
41 votes
Kathleen asked Sep 25, 2014
23,809 views
The string $1101$ does not belong to the set represented by$110^*(0 + 1)$1(0 + 1)^*101$(10)^*(01)^*(00 + 11)^*$(00 + (11)^*0)^*$
8.3k
views
1 answers
20 votes
Kathleen asked Sep 25, 2014
8,342 views
Regarding the power of recognition of languages, which of the following statements is false?The non-deterministic finite-state automata are equivalent to ... tape Turing machines are available are equivalent to Single-tape Turing machines.
9.7k
views
5 answers
21 votes
Kathleen asked Sep 25, 2014
9,728 views
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is$n$n^2$1$n+1$