Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
In which of the following languages is the finiteness problem undecidable? Select all that apply.
1
Regular Languages
2
Context Free Languages
3
Recursive Languages
4
Recursively Enumerable Languages