Simulations by time-bounded counter machines

DOI10.1142/S0129054111008106MaRDI QIDQ3086246zbMATH OpenFDO

Authors Holger Petersen

Publication date 30 March 2011

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

Full work available at URL https://doi.org/10.1142/S0129054111008106

zbMATH Keywords

counter machinessimulationstorage

Mathematics Subject Classification ID

Recommendations

• Simulations by Time-Bounded Counter Machines
• An Optimal Simulation of Counter Machines
• Counter machines
• On efficient simulations of multicounter machines
• scientific article; zbMATH DE number 3982518

Cites work

• Counter machines and counter languages
• Erasable context-free languages
• On the power of randomized multicounter machines
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Remarks on blind and partially blind one-way multicounter machines
• Remarks on the complexity of nondeterministic counter languages

Cited in

(9)

• Counter machines
• Counter machines and distributed automata -- a story about exchanging space and time
• Homing vector automata
• On efficient simulations of multicounter machines
• Simulations by Time-Bounded Counter Machines
• An Optimal Simulation of Counter Machines
• An Optimal Simulation of Counter Machines: The ACM Case
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)
• Reversible computations of one-way counter automata

This page was built for publication: Simulations by time-bounded counter machines

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