The state complexity of Turing machines

DOI10.1016/S0019-9958(70)90440-7MaRDI QIDQ5626626zbMATH OpenFDO

Authors Alfred A. Schmitt

Publication date 1970

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(70)90440-7

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cited in

(2)

• Complexity of algorithms and computations
• Separating the classes of recursively enumerable languages based on machine size

This page was built for publication: The state complexity of Turing machines

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