Language acceptors with a pushdown: characterizations and complexity

DOI10.1142/S0129054124430044MaRDI QIDQ6989494zbMATH OpenFDO

Authors Oscar H. Ibarra, Ian McQuillan

Publication date 30 April 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

counter machineslogarithmic spacepushdown automatapolynomial timefinite-turn acceptors

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Language acceptors with a pushdown: characterizations and complexity

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