SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES

DOI10.1142/S0129054111008106zbMath1219.68101MaRDI QIDQ3086246

Holger Petersen

Publication date: 30 March 2011

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

zbMATH Keywords

simulationstoragecounter machines

Mathematics Subject Classification ID

Related Items (3)

Counter machines and distributed automata -- a story about exchanging space and time ⋮ Homing vector automata ⋮ Unnamed Item

Cites Work

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

This page was built for publication: SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES