Question 9960 – Theory-of-Computation
December 6, 2023Question 9962 – Theory-of-Computation
December 6, 2023Question 9961 – Theory-of-Computation
Regarding the power of recognition of languages, which of the following statements is false?
Correct Answer: D
Question 26 Explanation:
B: No conversion possible from NPDA to DPDA.
C: Power (TM) > NPDA > DPDA.
C: Power (TM) > NPDA > DPDA.
The non-deterministic finite-state automata are equivalent to deterministic finite-state automata.
Non-deterministic Push-down automata are equivalent to deterministic Push- down automata.
Non-deterministic Turing machines are equivalent to deterministic Push-down automata.
Both B and C
Subscribe
Login
0 Comments