INF2080 Challenge I

As already announced in the grubletimer, there will be a series of challenges throughout the semester. Lucrative prizes (e.g., chocolate) await the winners!

The first challenge: Construct a finite automaton (DFA, NFA, all-NFA) that accepts the following language with as few states as possible:

L={a^120k | k >=0 }

The first submission of a correct automaton with less than 18 states wins! Submisions can be handed in during the lecture, group sessions, or by email. Good luck!