SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME
From MaRDI portal
Publication:5687659
DOI10.1142/S012905419600018XzbMath0859.68019OpenAlexW2011856828MaRDI QIDQ5687659
Publication date: 31 March 1997
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905419600018x
Related Items (2)
A decidable characterization of the classes between lintime and exptime ⋮ A predicative and decidable characterization of the polynomial classes of languages
This page was built for publication: SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME
