A simulation result for the auxiliary pushdown automata

DOI10.1016/0022-0000(79)90023-0zbMATH Open0427.68051OpenAlexW2076889648MaRDI QIDQ1136497FDOQ1136497

Authors: Tero Harju 

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90023-0

zbMATH Keywords

simulationpushdown automataauxiliary storageturing machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Title not available (Why is that?)
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Title not available (Why is that?)

Cited In (2)

• Tree-size bounded alternation
• Sweeping input-driven pushdown automata

This page was built for publication: A simulation result for the auxiliary pushdown automata

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