Simulations by Time-Bounded Counter Machines

DOI10.1007/978-3-642-02737-6_33zbMath1247.68090OpenAlexW1505593558MaRDI QIDQ3637243

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

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
• On the power of randomized multicounter machines
• Counter machines and counter languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simulations by Time-Bounded Counter Machines