Let L be a regular language on = { b , d , e }. Let

Let L be a regular language on Σ = {b,d,e}.

Let L’ be the set of strings in L that have the prefix deb.

Show that L’ is a regular language.

Show transcribed image text Σ = {b, d, e}

Σ = {b, d, e}