Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

According to my book the definition of a deterministic Pushdown automaton allows for $\delta(q,\epsilon,Z)$ to be non-empty if $$\forall\sigma\in\Sigma:\,\delta(q,\sigma,Z)\neq\emptyset$$

Can someone please explain/give motivation for this definition ?

Mainly, why is the automaton deterministic if we allow $\epsilon$ movements ? why do we condition it on the (strange) condition that $\forall\sigma\in\Sigma:\,\delta(q,\sigma,Z)\neq\emptyset$ ?

share|cite|improve this question
up vote 3 down vote accepted

That looks like a typo: the usual definition is that if $\delta(q,\epsilon,Z)\ne\varnothing$, then $\delta(q,\sigma,Z)$ must be empty for each $\sigma\in\Sigma$, so that there’s no ambiguity.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.