Formal Languages : Exercise

1. Show that a language L is deterministic and prefix (L∩LΣ⁺=∅) if and only if there exists a deterministic automaton accepting L by empty stack.

2. Show that, for deterministic pushdown automaton, accepting by empty stack is equivalent to accepting by empty stack and final state.