Which one of the following is TRUE?
A
The language L={a^n b^n |n>0 } is regular
B
The language L={a^n |n is prime } is regular
C
The language L={w|w has 3k+1 b’s for some k } is regular
D
None of the mentioned
Correct Answer: The language L={w|w has 3k+1 b’s for some k } is regular
Only for this option we can build a FA.