Question

Write formal definition of DPDA ?

Answer 1

Formally, a language L over Σ is deterministic context free, or L is a DCFL , if L$ is accepted by a DPDA M where $ is a dedicated symbol not belonging to Σ.