MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Turing machines are more powerful than both finite automata (FA) and pushdown automata (PDA). They are as powerful as any computer we have ever built. Infinite “all” accessible memory (in the form of a tape) – option to read and write to it.

Detailed explanation-2: -Turing machines are more powerful than both finite automata and pushdown automata. They are as powerful as any computer we have ever built.

Detailed explanation-3: -Note that Turing machines are more powerful than FSA, PDA, and LBA (linear-bounded automata)-recall the Chomsky hierarchy. By power, we mean the ability to recognize more languages.

Detailed explanation-4: -Turing machine is more powerful than: (A) Finite automata (B) Push down automata (C) Both (a) and (b) (D) None of these Ans: c Explanation: Turing machines are more powerful because they can remember more than FA because FA don’t have memory to remember.

Detailed explanation-5: -The earlier models like finite automata and push-down automata are not considered accurate models because they cannot recognize the simple language. But the turing machine is the most accurate model for personal computers. A turing machine is capable of solving every problem that a real computer can do.