Computer Science, asked by bhamasrarao666, 7 months ago

The grammar G = ({S, B}, {a, b}, P, {S}) where P = > S → aB and B → bB | ϵ represents the language L defined by regular expression ___________ *
1 point
ab
a*b*
a*b
ab*

Answers

Answered by lasya5974
0

Answer:

sorry

Explanation:

please thank for my answers

sorry ones again

Similar questions