In 16—18, write five strings that belong to the language defined by the given regular expression.

17. b * | b * a b *

Write five strings that belongs to the language defined by the given regular expression.

b*|b*ab*

Given information:

The regular expression is

b*|b*ab*

Concept used:

Write the arbitrary strings for the expression b*|b*ab*

Calculation:

It is required to give five strings that belong to the language defined by the given regular expression b*|b*ab*. Here * in the exponent represent Kleen closure of the expression that is ¡t denotes the concatenation of expression or variable with itself any finite number (including zero) of times. The symbol | denotes either one of the expression towards its left or light is to be considered. Using the above definitions five strings can be written (from infinitely many others) as follows

1) b (Considering the string b from b* only since we can consider either of the expression b*b* or b*ab* )

2) bb (Considering the string bb</