← Quiz: CFG and PDA: all 10 questions
Quiz: CFG and PDA · Question 10 of 10
Why are deterministic PDAs weaker than nondeterministic PDAs?
Why are deterministic PDAs weaker than nondeterministic PDAs?
- A.Deterministic PDAs have no stack
- B.Some languages, such as even-length palindromes, need the machine to guess where the middle is
- C.Nondeterministic PDAs have two stacks
- D.They are equally powerful, like DFAs and NFAs
Answer & explanation
Correct answer: Some languages, such as even-length palindromes, need the machine to guess where the middle is
Unlike finite automata, determinism really does reduce the power of PDAs.
Can you get the rest right without peeking?
Take the timed Quiz: CFG and PDA quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →