Consider the language L = { aⁿb²ⁿ | n > 0 }.

Give an implementation description for an enumerator for L

Is L regular, context-free but not regular, or not even context-free?

Is L decidable?

Idea: An enumerator is a TM that prints, so explain how a TM, started on an empty tape, would go about printing all of the strings in L to an output tape (this can just be the empty input tape). Add a tape symbol # if you want a separator between strings, so the output would look like abb#aabbbb#aaabbbbbb# .