Theory of Computation MCQ

1. Which technique allows a Turing machine to simulate any other Turing machine with an arbitrary input? a) Multitape Turing machineb) Multihead Turing machinec) Universal … Read more

1. Which of the following is an example of a Pushdown Automaton (PDA)? a) Deterministic Finite Automaton (DFA)\b) Non-deterministic Finite Automaton (NFA)\c) Deterministic Pushdown Automaton … Read more

1. Which of the following is NOT a type of grammar in Chomsky hierarchy?a) Context-sensitive grammarb) Regular grammarc) Linear grammard) Context-free grammar Answer: c) Linear … Read more

1. Which of the following is NOT a type of Finite Automata?A) NDFAB) DFAC) PDAD) 2-way DFAAnswer: C) PDAExplanation: Finite Automata includes NDFA (Non-Deterministic Finite … Read more

1. Which of the following is not an example of an automata machine?a) Turing machineb) Finite automatonc) Pushdown automatond) Quick Sort algorithm Explanation: The Quick … Read more