∑ = {a, b}
Answer:
We follow the rule of the previous example to design a machine.
So, that we assume some string within this given language L = {ab, aab, aabb, abbb, ……}
First design a machine for the minimum string “ab” then complete all rest of the input moves for all states as per language.
Regular expression: L = a(a + b)* b
Grammar:
S → aA
A → aA | bB
B → bB | aA | λ