UGC-NET, GATE,Theory of Computation Test Preparation

Test Preparation on UGC-NET, GATE,Theory of Computation Test Preparation

1.

Assume the statements S1 and S2 given as : S1 : Given a context free grammarG, there exists an algorithm for determining whether L(G) is infinite. S2 : There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true ?

1S1 is correct and S2 is not correct.
2Both S1 and S2 are correct.
3Both S1 and S2 are not correct.
4S1 is not correct and S2 is correct.

2.

The number of eight-bit strings beginning with either 111 or 101 is ______.

164
2128
3265
4None of the above

3.

Which of the following conversion is not possible (algorithmically)?

1regular grammar to context-free grammar
2nondeterministic FSA to deterministic FSA
3nondeterministic PDA to deterministic PDA
4nondeterministic TM to deterministic TM

Check your progress:


Right Ans	Wrong Ans	Not Attempted

Prev Question Next Question Show Answer