Simulations by Time-Bounded Counter Machines

DOI10.1007/978-3-642-02737-6_33zbMATH Open1247.68090OpenAlexW1505593558MaRDI QIDQ3637243FDOQ3637243

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

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

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Title not available (Why is that?)
• Remarks on the complexity of nondeterministic counter languages
• Counter machines and counter languages
• Title not available (Why is that?)
• On the power of randomized multicounter machines

Cited In (3)

• On efficient simulations of multicounter machines
• Simulations by time-bounded counter machines
• Title not available (Why is that?)

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)