Which of the following pairs have DIFFERENT expressive power?

Related MCQs

• Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;
• A random access machine (RAM) and truing machine are different in
• The …………. is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree .
• Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.
• The regular expression have all strings in which any number of 0’s is followed by any number of 1’s followed by any number of 2’s is :
• The set which is not countable if we have ∑ = {a, b}, 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 of the following strings is not generated by the following grammar? S → SaSbS ε
• Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the computation of M on w visit the state q? Which of the following statements about x is correct?
• Consider the following CFG S → aB S → bA**spaceB → b A → a**spaceB → bS A → aS**spaceB → aBB A → bAA**space Consider the following derivation **spaceS ⇒aB**space⇒aaBB**space⇒aaBb**space⇒aabSb**space⇒aabbAb**space⇒aabbab**space This derivation is