FOR FREE CONTENT

Design a DFA for Language: “At most one ‘a’”

= {a, b}

 

Answer:

 

L = {λ, a, abb, abbb, …..}

 

We can write two regular expressions of the above language:

RE = b* + b*ab* 

 

Grammar:

S → bS|aAλ

A → bA|λ