Register

Kerala PSC AP Exam

347 views
0 votes
0 votes
Which of the following is not decidable:

A) Given a Turing machine M, a string S and an integer k, M accepts S within k steps

B) Equivalence of two given turing machines

C) Language accepted by a given finite state machine is not empty

D) Language generated by a context free grammar is not empty
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Sankaranarayanan P.N asked Sep 28, 2016
1,523 views
Kerala PSC AP Exam
Choose the correct statement A) The recursive enumerable sets are closed under complementation B) Deterministic context free languages are closed under intersection C)Context sensitive languages are closed under homomorphism D) A is recursive if both A and its complement are accepted by Turing machine
Choose the correct statementA) The recursive enumerable sets are closed under complementationB) Deterministic context free languages are closed under intersectionC)Contex...
User Avatar
0 votes
0 votes
0 answers
3
Sankaranarayanan P.N asked Oct 27, 2016
308 views
Kerala PSC AP Exam
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is A) 15 B) 11 C) 12 D) 10
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree isA) 15B...
User Avatar
0 votes
0 votes
0 answers
4
Sankaranarayanan P.N asked Oct 27, 2016
330 views
Kerala PSC AP Exam
The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
User Avatar
Link Copied!