edited by
32,935 views
59 59 votes

The string $1101$ does not belong to the set represented by

  1. $110^*(0 + 1)$
  2. $1(0 + 1)^*101$
  3. $(10)^*(01)^*(00 + 11)^*$
  4. $(00 + (11)^*0)^*$

8 Answers

Best answer
65 65 votes

Only (a) and (b) can generate $1101$.

In (c) after $11$, we can not have $01$ and so $1101$ cannot be generated.

In (d) Every $11$ followed by $0$ and no single occurrence of $1$ is possible. So it cannot generate $1101$ or $11011$.

edited by
16 16 votes

I think option (c) is more appropriate to choose from, because even option (d) can generate 11011 or 110110 in which 1101 is a substring.

2 2 votes

option d is quite inviting to choose it as we can have only even number of 1's with this regular set where as our original string contains 3 1's

2 2 votes

from option c and d we can't generate string 1101.

therefore both c and d are correct

1 1 vote
c and d both are right

So,No need much think about which one is more correct and which one to choose because both are equally correct & if we take 1101 as substring (instead of string in question) then c will be answer but  should we correct that?

I think we should not apply over logic in correcting question and if such a ambiguity arise now a day they will give marks to all.
Answer:
Position:
Show:

Related questions

50 50 votes
8 answers 8 answers
16.4k
16.4k views
Arjun asked Oct 17, 2014
16,419 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 i...
52 52 votes
5 answers 5 answers
17.3k
17.3k views
Kathleen asked Sep 25, 2014
17,314 views
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...
25 25 votes
1 answers 1 answer
10.1k
10.1k views
Kathleen asked Sep 25, 2014
10,113 views
Regarding the power of recognition of languages, which of the following statements is false?The non-deterministic finite-state automata are equivalent to deterministic fi...
27 27 votes
4 answers 4 answers
10.3k
10.3k views
Kathleen asked Sep 25, 2014
10,291 views
Which of the following statements is false?Every finite subset of a non-regular set is regularEvery subset of a regular set is regularEvery finite subset of a regular set...