A proper superset of context free languages.

Always recognizable by pushdown automata.

Also called Type $$(0)$$ languages.

Recognizable by Turing machines.

An arbitrary Turing machine halts after 10 steps.

A Turing machine prints a specific letter.

A Turing machine computes the product of two numbers.

None of the above.