Exam 4: Omputer Science and Theory of Computation

Which statement is true?

In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called

The symbols that can't be replaced by anything are called -----------------

Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be

Which of the following statement is false for a turing machine?

Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as

Which of the following will be used for text searching application-?

State table of an FSM is given below. There are two states A And B, one input and one output. Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B = 1 with output = 1 the minimum length of input string required will be

Which of the following instances of the post correspondence problem has a viable sequence (a solution)?

Left hand side of a production in CFG consists of:

Consider a graph G = (V, E) where I V I is divisible by 3. The problem of finding a Hamiltonian cycle in a graph is denoted by SHAM3 and the problem of determining if a Hamiltonian cycle exits in such graph is denoted by DHAM3. The option, which holds true, is

Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. Which one of the following is TRUE?

If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by Select correct option:

Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is undecidable. The statement that holds true is

Two persons X and Y have been asked to show that a certain problem p is NP-complete. X shows a polynomial time reduction from the 3-SAT problem to p and Y shows a polynomial time reduction from p to 3-SAT. From these reduction it can be inferred that

Which one of the following is not decidable?

Choose the incorrect statement.

The problem 3-SAT and 2-SAT are

Context free grammar is used for-

3-SAT and 2-SAT problems are