The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+13 votes
1.6k views

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
in Theory of Computation by Veteran (52.1k points)
edited by | 1.6k views

3 Answers

+17 votes
Best answer

(b) is False. 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.

by Veteran (418k points)
edited by
0
example of option B)a^nb^n is non regular subset of regular (a/b)*.
0 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
by (11 points)
–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

by Boss (14.3k points)
0
No. The set you gave is infinite. Any finite set is trivially regular as there are only finite number of strings. (Finite class of languages is a subset of regular class).

Your example is for (b) and that is the false statement.
+3
sorry for it.it  is a silly mistake i thought it is a very easy question so i just took any option infront of me .it happens with me at times

(b) Every subset of a regular set is regular this is false
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,984 questions
55,138 answers
190,495 comments
85,159 users