Skip to main content
Computer Science

Return to Answer

added 1 character in body
Source Link
Joey Eremondi
Joey Eremondi
  • 30.1k
  • 5
  • 66
  • 122

  1. Look at the product construction for DFAs, it will give you a hint of what the state space of a PDA accepting the intersection will look like.

  2. You can covertconvert $D$ to a PDA, but you have more information than that. It doesn't need to touch the stack at all, since it can be accepted by a DFA.

These should get you close to the answer.

  1. Look at the product construction for DFAs, it will give you a hint of what the state space of a PDA accepting the intersection will look like.

  2. You can covert $D$ to a PDA, but you have more information than that. It doesn't need to touch the stack at all, since it can be accepted by a DFA.

These should get you close to the answer.

  1. Look at the product construction for DFAs, it will give you a hint of what the state space of a PDA accepting the intersection will look like.

  2. You can convert $D$ to a PDA, but you have more information than that. It doesn't need to touch the stack at all, since it can be accepted by a DFA.

These should get you close to the answer.

Source Link
Joey Eremondi
Joey Eremondi
  • 30.1k
  • 5
  • 66
  • 122

  1. Look at the product construction for DFAs, it will give you a hint of what the state space of a PDA accepting the intersection will look like.

  2. You can covert $D$ to a PDA, but you have more information than that. It doesn't need to touch the stack at all, since it can be accepted by a DFA.

These should get you close to the answer.