Question

write smallest possible string accepted by regular expression (11)*(00)*+(10+01)*.1​

Answer 1

Answer:

yes it is possible

Explanation:

Answer 2

The smallest string accepted by the given regular expression is ∈.

Explanation:

• Given regular expression $(11)^{*}(00)^{*}+(10+01)^{*}$.
• From the given regular expression, corresponding regular language consists of only two symbols $\Sigma= \{0, 1\}$.
• The given regular expression has option to generate either the first pattern  $(11)^{*}(00)^{*}$ or the second pattern $(11)^{*}(00)^{*}+(10+01)^{*}$.
• Now, the strings produced by first pattern are : {∈, 11, 00, 1100, 1111, 0000,. . . . . . .}.
• Also, the strings generated by second pattern are : {1, 101, 011, 10011, 01101, . . . . . . }
• Hence the language generated by the given regular expression will be : {∈ , 11, 00, 1100, 1111, 0000, . . . . . . ., 1, 101, 011, 10011, 01101, . . . . . .}
• So, The smallest string accepted by the given regular expression is ∈.