nondeterministic

  1. A

    Is it always possible to convert a non-deterministic PDA to a deterministic one?

    Is it always possible to convert a non-deterministic PDA to a deterministic one? What is the significance of this observation for the computing power of context-free grammars?
  2. M

    Draw a non-deterministic PDA for the following CFG.?

    Draw a non-deterministic PDA for the following CFG. S-> bS | aY Y -> aY | bZ Z -> aY | bS | ^
Top