0
$\begingroup$

I have a question about the DPDA. Is it possibly to have two transitions that read the same input but do different in the stack?

An example would be A transition from q1 to q2 where I read input ( pop v and push nothing to the stack. And the second transition is from q1 to q3 where I read input ( pop x and push nothing to the stack. Notice that x and v is diffrent symbols

I understand that the stack won't be confused because it depends on what is the top most symbol in the stack. So I think this is fine in a DPDA. Am i thinking right?

Improve this question
$\endgroup$
1
  • 1
    $\begingroup$ Please check the formal definition of a DPDA. Note that the transition is based on the current state, input, and top stack symbol. $\endgroup$
    – Russel
    May 18 at 11:07

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.