1,484 views
6 votes
6 votes

The regular expression 0*(10)* denotes the same set as:

A)  (1*0)*1*

B)  0+(0+10)+

C)  (0+1)*10(0+1)*

D)  none of the above

well according to me in option A we can get 111111...(many no of one's) without the need of 0, but same is not the case with the original R.E posted above, where in i have to get 0's in order to get 1's in my strings. <answer given is option A> what do you say guys??

3 Answers

Best answer
11 votes
11 votes
A can generate "11" but given RE can't

B can generate "100" but given RE can't

C can generate "100" but given RE can't

So, answer must be D- none of these.
selected by
1 votes
1 votes

RE0*(10)* (in question)


Here is a trick for option B) and C) 

B)  0+(0+10)+                           

C)  (0+1)*10(0+1)*

Both of these cannot accept Empty set or Empty Strings  0*(10)* can and for option a you need a check.

A)  (1*0)*1* vs   RE:0*(10)*(in question)  A can generate "11" but given RE can't

as provided by Arjun Sir.
 


 

Related questions

1.4k
views
2 answers
0 votes
sanju77767 asked May 1, 2018
1,400 views
Find length of string of minimum length on {0,1}* not in the language corressponding to the given RE 0^*(01^*)^* options are 123None of theseIs it asking to find the mini...
112
views
0 answers
0 votes
rdrd44 asked May 3
112 views
In certain programming languages, comments appear between delimiters such as (* and ) . Let C be the language of all valid delimited comment strings. Such a string in C...
118
views
1 answers
1 votes
prabhath challa asked Apr 18
118 views
what will be the regular expression of this DFA using Arden's theorem
189
views
0 answers
0 votes
Talha Riaz asked Mar 23
189 views
1. Write regular expressions and draw NFA for the following languages over the alphabet Σ = {a, b}: a. All strings that do not end with aa. b. All strings that contain a...