This is from an old exam, the last Task no one could solve correctly and I'm curious how it's done :p
Show that the set of decimal representation (without leading zeroes) of the divisible numbers by
4 (natural numbers) is regular.
By this thread How to prove a language is regular? I know that one can make a DFA to Show that a language is regular.
But is that possible at all because we have infinite natural numbers that are divisible by
I cannot even imagine how that DFA would look like :o
Maybe there is another way of showing this, too?