ab L w w ab L w w avb n 1 v L is not a regular la

=(a,b}

   L = { w : w = ab },
   L = { w : w = avb, n 1, v ^* }

L is not a regular language, but L is. Prove L is a regular language by exhibiting a concise regular expression that generates every string in the language.

Solution

Answer:

Since v belongs to (a+b)* it will cover all the string in between, therefore our language become :

L = { set of all strings starts with a and ends with b }

For this language we can draw DFA. Thus the language is regular language.