Publisher： Cambridge University Press
E-ISSN： 1943-5886|65|2|567-604
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.65, Iss.2, 2000-06, pp. : 567-604
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES
The Journal of Symbolic Logic, Vol. 80, Iss. 4, 2015-12 ,pp. :
Comparing Verboseness for Finite Automata and Turing Machines
By Tantau Till
Theory of Computing Systems, Vol. 37, Iss. 1, 2004-01 ,pp. :
Turing machines and the spectra of first-order formulas
The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. :