Across
- 1. A null production can be referred to as _____
- 3. A PDA has an infinite amount of memory due to this structure
- 5. The root of derivation tree is always contains____
- 6. A PDA is said to be _____ if it has atmost one transition around all configuration
- 7. A _______can have multiple transition for the same input symbol from a given state
- 8. Which Automata take stack as storage?
- 9. PDA differs from finite automata in its ____
Down
- 2. If the partial derivation contains the root of start variable the form is said to be ___
- 4. The grammar G=(V,T,P,S) belongs to ____language
- 6. The set of even length palindrome over (a,b) with centre can be accepted by NPDA or DPDA