engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Consider the following languages, here is the encoding of Turing Machine. Select the language which is/are recursive language.
1
L1 = { | M accepts w}
2
L2 = { | M is a Turing Machine that have final state}
3
L3 = { | M have ‘k’ states, where k∈N}
4
L4 = { | M accepts ‘∈’}