A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Linearity is polynomially decidable for realtime pushdown store automata
1979
Information and Control
i If M is a realtime deterministic pushdown store acceptor, the language L(M) accepted by M by final state and empty store is linear context-free if and only if a certain grammar obtained from M is linear context-free. Hence, it is polynomially decidable for realtime deterministic pushdown store automata M whether L(M) is linear context-free. If M is a realtime deterministic pushdown store acceptor and L(M) is linear context-free, we can construct a realtime single turn deterministic pushdown
doi:10.1016/s0019-9958(79)90134-7
fatcat:p6k4foitfvfmpa47aighxiuacy