Register

GATE IT 2005 | Question: 5

• edited by
16,505 views
59 59 votes

Which of the following statements is TRUE about the regular expression $01^*0$?

  1. It represents a finite set of finite strings.
  2. It represents an infinite set of finite strings.
  3. It represents a finite set of infinite strings.
  4. It represents an infinite set of infinite strings.

5 Answers

Best answer
99 99 votes

Correct Option: B

Infinite set (because of $^*$) of finite strings. A string is defined as a FINITE sequence of characters and hence can never be infinite. 

• edited by
4 4 votes

The given expression01*0 is regular. So this is a finite string. So options C and D are false and * is placed. So this is infinite set.
So, given regular expression represents an infinite set of finite strings.

 

Optins B is correct

2 2 votes
string can be of infinite length but if it is recognised by finite automaton then this is finite so i think infinite number of strings are possible but the string length will be finite as it can be represented by the finite automaton so ans B
1 flag:
✌ Low quality (jacknroll “string must be of finite length”)
0 0 votes
SET: can be finite set if number of elements are finite and infinite set if numbe of elements are infinite
String:finite sequence of symbol of alphabet a string always must be finite in lenght and all symbol taken from alphabet where it is defined
now a set can be infinte and string cant be
so here we are generating a infinte set since number of strings will be infinite and u got ur answer
0 0 votes

there our set is infinite 
and each element in set which is string are of finite length
Means u have finite lenght string and they are infinite in numbers
so
answer is B

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE IT 2005 | Quest...Next → · GATE IT 2005 | Quest...
← Previous in category · GATE IT 2005 | Quest...Next in category → · GATE IT 2005 | Quest...
Position:
Show:

Related questions

36 36 votes
4 answers 4 answers
26.6k
26.6k views
Ishrat Jahan asked Nov 3, 2014
26,630 views
GATE IT 2005 | Question: 40
A language $L$ satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about $L$ is TR...
26 26 votes
2 answers 2 answers
10.5k
10.5k views
Ishrat Jahan asked Nov 3, 2014
10,548 views
GATE IT 2005 | Question: 6
The language $\{0^n 1^n 2^n \mid 1 \leq n \leq 10^6\}$ isregularcontext-free but not regularcontext-free but its complement is not context-freenot context-free
43 43 votes
3 3 answers
10.2k
10.2k views
Ishrat Jahan asked Nov 3, 2014
10,238 views
GATE IT 2005 | Question: 83a
Consider the context-free grammar$E \rightarrow E + E$$E \rightarrow (E * E)$$E \rightarrow id$where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\...
40 40 votes
6 answers 6 answers
14.6k
14.6k views
Ishrat Jahan asked Nov 3, 2014
14,642 views
GATE IT 2005 | Question: 51
Let $T(n)$ be a function defined by the recurrence$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and$T(1) = 1$Which of the following statements is TRUE?$T(n) = \Theta(\log n)$...