334 views
2 votes
2 votes
A considered the sets of TMs describing all the Hamiltonian cycle problems, Choose the correct statement,

1) The membership problem of S is decidable.

2) It is decidable if the complement of S is empty.

3) It is decidable if S is empty, finite or infinite.

4) It is decidable if S = ∑*.

Please log in or register to answer this question.

Related questions

3 votes
3 votes
2 answers
2
0 votes
0 votes
2 answers
3
Ayush Upadhyaya asked Jul 31, 2018
449 views
I am getting 8 gates as an answer to this. Can it be less than this?
0 votes
0 votes
1 answer
4
Abhisek Das asked Jun 29, 2018
571 views
Find a recurrence relation for the number of bit stringsof length n that contain a pair of consecutive 0s.