Question: 9 . Let Sigma = { a } . Show that the language L = { a ^ n: n > 0 , n

9. Let \Sigma ={a}. Show that the language L ={a^n: n >0, n is odd} is regular.
 9. Let \Sigma ={a}. Show that the language L ={a^n: n

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!