Simulations by Time-Bounded Counter Machines

DOI10.1007/978-3-642-02737-6_33MaRDI QIDQ3637243zbMATH OpenOpenAlexFDO

Authors Holger Petersen

Publication date 7 July 2009

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02737-6_33

Mathematics Subject Classification ID

Recommendations

• Simulations by time-bounded counter machines
• An Optimal Simulation of Counter Machines: The ACM Case
• An Optimal Simulation of Counter Machines
• On efficient simulations of multicounter machines
• Counter machines

Cites work

• scientific article; zbMATH DE number 3690693 (Why is no real title available?)
• scientific article; zbMATH DE number 1142308 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Counter machines and counter 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 the complexity of nondeterministic counter languages

Cited in

(3)

• On efficient simulations of multicounter machines
• Simulations by time-bounded counter machines
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)

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 Q3637243)