Consider a language Bn = {a ^ k: k is a multiple of n} over the unitary alphabet {a}. Prove that, for any integer n> = 1, Bn is regular.
Consider a language Bn = {a ^ k: k is a multiple of n} over the unitary alphabet {a}. Prove that, for any integer n> = 1, Bn is regular.