📊 Theory of Computation and Compiler Design
Q. Which one of the following is FALSE?
  • (A) There is unique minimal DFA for every regular language
  • (B) Every NFA can be converted to an equivalent PDA.
  • (C) Complement of every context-free language is recursive.
  • (D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
💬 Discuss
✅ Correct Answer: (D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. A collective communication in which data belonging to a single process is sent to all of the processes in the communicator is called a _______________

Q. It is possible to design a Linear regression algorithm using a neural network?

Q. The focus in a sequence diagram is on _____.

Q. Core of soft computing is

Q. What is the time complexity to count the number of elements in the linked list?

Q. Using which customized endpoint will be accessed over HTTP?

Q. What happens when the value of k is 0 in the Floyd Warshall Algorithm?

Q. Which of the following property defines a transaction as something that cannot be subdivided and must be completed or abandoned as a unit?

Q. Which of the following evaluation metrics can not be applied in case of logistic regression output to compare with target?

Q. print(maximum(2, 3))

📊 Question Analytics

👁️
40
Total Visits
📽️
2 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
82%
Success Rate