edited by
9,684 views
41 votes
41 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.
edited by

3 Answers

Best answer
66 votes
66 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
1 votes
1 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

1 votes
1 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
Answer:

Related questions

23 votes
23 votes
1 answer
2
Ishrat Jahan asked Nov 3, 2014
6,378 views
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
30 votes
30 votes
5 answers
4
Ishrat Jahan asked Nov 3, 2014
9,232 views
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)$...