Question

describe the language corresponding to following (1+01)*(0+01)*​

Answer 1

Answer:

bozbibzibzjbjzbjzbjbsjbdk

Explanation:

bHvUvauavhvshvshvsjdbjdbibfuvduvdyvduhd

Answer 2

Answer:

The language can be written as: L(G)={0,10,01,000,0100,1010101,10100…..}

Explanation:

• Following the above-mentioned rules, ∈-NFA of Regular Language L =0(0+1)*1 is to be constructed.
• L = 0(0+1)*1 can be divided into three parts- 0, (0+1)*, 1. The second part, (0+1)*, will be drawn with the help of third rule (a+b) where a = 0 and b = 1, followed by second rule a* where a = (0+1). Below is its ∈-NFA.
• Since 0 and 1 are just concatenated to the second part, the final ∈-NFA is drawn with the help of the fourth rule, ab.
• The Final ∈-NFA will be –
• ∈-NFA for L = (00)*1(11)* :
• Following the above-mentioned rules, ∈-NFA of Regular Language L = (00)*1(11)* is to be constructed.
• L = (00)*.1.(11)* can be divided into three parts for the ease of constructing ∈-NFA. The first part is (00)*, the second part is 1 and the third one is (11)*. Since they are all concatenated to each other, the main structure is drawn with the help of the fourth rule, ab. Now, to understand the structure of the first part (00)*, the reference must be taken from the fourth, i.e. ab and the second rule, i.e. a*. First 00 are concatenated, then it is considered as one unit and applying the second rule, (00)* is drawn. Below is its ∈-NFA.