Question

Give a Context Free Grammar (CFG) that accepts the following regular expression (abb + b)* (ab)* + ɛ and convert into an equivalent CFG in Chomsky Normal Form (CNF).

Answer 1

Answer:

Note: Its a question of (finite theory of automata), kindly give the answer with understandings and formulae, proper steps, and correct output. I will definitely give you a thumbs up if the asked question is properly answered.