The state complexity of Turing machines
From MaRDI portal
Publication:5626626
DOI10.1016/S0019-9958(70)90440-7zbMath0222.02038MaRDI QIDQ5626626
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Related Items (2)
Separating the Classes of Recursively Enumerable Languages Based on Machine Size ⋮ Complexity of algorithms and computations
This page was built for publication: The state complexity of Turing machines
