Prove that the language $\{a^{k} \mid k \equiv 0 \text{ or }k\equiv 2 \pmod 5\}$ is a regular language. I am just trying to figure this problem out for my own benefit. I am new to learning this stuff. If anyone can offer help that would be wonderful.
Regular Language
2
$\begingroup$
automata
regular-language