Characterizations of pushdown machines in terms of time-bounded computers

DOI10.1145/3588287.3588298MaRDI QIDQ6979511zbMATH OpenFDO

Authors Stephen Cook

Publication date 25 May 2025

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Theory of computing (68Qxx) Complexity of computation (including implicit computational complexity) (03D15) Computer science (68-XX)

This page was built for publication: Characterizations of pushdown machines in terms of time-bounded computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979511)