where a^{n} denotes "a" repeated n times. Assume that 0 is not a multiple of 3.
Turn in as part of your homework solutions:
Note that "aabaab" belongs to L, but "abaaab" does not.
Show that L is decidable by providing a detailed algorithm (in pseudo-code) to decide this
language.
Hint: Construct a 2-tape non-deterministic Turing machine that decides this
language and then explain why there must be a regular (single-tape, deterministic)
Turing machine that decides this language.