Weighted simple reset pushdown automata (Q2422031)

The authors introduce a new type of weighted pushdown automaton with limited access to the pushdown stack. At each transition step the automaton may pop or push a single pushdown symbol or leave the stack unaltered, and no \(\epsilon\)-transitions are allowed. It is shown that all weighted context-free languages, i.e., algebraic power series, are recognized by such automata.