which of the following is not a finite state language?
(a) L = {02n ; n>=0} on ∑ = {0}
(b) L = {s | s ∈ {0,1}* and s when interpreted as a binary string is such that s mod 5 = 0 }
(c) L = {s | s ∈ {0,1}* and s when input from least significant bit to most significant bit is such that its integer interpretation is divisible by 2 }
(d) L = {0,0000,00000000,........} on ∑ = {0}