A note on bounded-reversal multipushdown machines
Let P(k,n) denote the class of deterministic two-way k-pushdown automata M such that the accepted language T(M) is included in \(a^*\) and M can make at most n reversals in each of its k pushdown tapes. It is shown that P(1,n) induces only regular languages T(M) but there is an automaton M in P(2,1) with T(M) not regular.
scientific article; zbMATH DE number 3896331