2DPDA

Two-way DPDA. Other names: TWDPDA.

Read more here:

• Two-way pushdown automata ↗, 1967
  • $\{a^nb^nc^n \mid n \geq 1\}$
  • $\{a^{2^n} \mid n \geq 1\}$
  • THEOREM 4.2. Given any TWDPDA(A), one can effectively construct a DLBA(B) such that L(B) = L(A)
• Descriptional complexity of two-way pushdown automata with restricted head reversals ↗, 2012
• Simulation of Two-Way Pushdown Automata Revisited ↗, 2013