Question: 9 . Let Sigma = { a } . Show that the language L = { a ^ n: n > 0 , n
Let Sigma a Show that the language L an: n n is odd is regular.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
