1 votes 1 votes Ans. C Theory of Computation theory-of-computation regular-expression regular-language + – Na462 asked Aug 30, 2018 Na462 1.7k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Na462 commented Aug 30, 2018 reply Follow Share Brother 1. one doubt in R4 exactly only those strings will be accepted which i showed u in above set right ? 2. and say had there been a star on top of it i.e. (1* + 0* ) * = {^,1,11,111,1111...,0,00,000,0000....}* means the string should be decomposed from this above strings given in set ====> Means it generates any binary string as we have 0,1 in the set as well right ? 0 votes 0 votes Na462 commented Aug 30, 2018 reply Follow Share So brother R4 generates only the string containing ones or containing 0 not the mixture of both am i right ? 0 votes 0 votes goxul commented Aug 30, 2018 reply Follow Share Yes, that's correct. It'll be the union of strings which have all 1s and all 0s. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes R4 = {0,00,000,0000 ...,1,11,111,1111,11111,...} R1 = {0,00,000,0000, ...,1,11,111,1111,...,01,001,00111,......} ans- C Shailendra_ answered Sep 10, 2019 Shailendra_ comment Share Follow See all 0 reply Please log in or register to add a comment.