{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:05:43Z","timestamp":1759133143005},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1974,10,1]],"date-time":"1974-10-01T00:00:00Z","timestamp":149817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14169,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,10]]},"DOI":"10.1016\/s0022-0000(74)80008-5","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"213-229","source":"Crossref","is-referenced-by-count":38,"title":["Comparing complexity classes"],"prefix":"10.1016","volume":"9","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80008-5_bib1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0201019","article-title":"On languages accepted in polynomial time","volume":"1","author":"Book","year":"1972","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0022-0000(74)80008-5_bib2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","article-title":"Quasirealtime languages","volume":"4","author":"Book","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(74)80008-5_bib3","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0022-0000(70)80031-9","article-title":"Time-and tape-bounded Turing acceptors and AFLs","volume":"4","author":"Book","year":"1970","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0022-0000(74)80008-5_bib4","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/S0022-0000(70)80032-0","article-title":"Tape-bounded Turing acceptors and principal AFLs","volume":"4","author":"Book","year":"1970","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0022-0000(74)80008-5_bib5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/S0019-9958(71)80004-9","article-title":"A note on AFLS and bounded erasing","volume":"19","author":"Book","year":"1971","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(74)80008-5_bib6","series-title":"Currents in the Theory of Computing","first-page":"35","article-title":"Computational complexity\u2014theory and practice","author":"Borodin","year":"1973"},{"key":"10.1016\/S0022-0000(74)80008-5_bib7","series-title":"Proc. 1964 Congress for Logic, Math., and Phil. of Sci.","first-page":"24","article-title":"The intrinsic computational difficulty of functions","author":"Cobham","year":"1964"},{"key":"10.1016\/S0022-0000(74)80008-5_bib8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80008-5_bib9","series-title":"Proc. Third ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(74)80008-5_bib10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0022-0000(73)80028-5","article-title":"A hierarchy for nondeterministic time complexity","volume":"7","author":"Cook","year":"1973","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0022-0000(74)80008-5_bib11","article-title":"Contributions to the model theory of finite structures","author":"Fagin","year":"1973"},{"key":"10.1016\/S0022-0000(74)80008-5_bib12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","article-title":"Principal AFL","volume":"4","author":"Ginsburg","year":"1970","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0022-0000(74)80008-5_bib13","article-title":"The LBA problem and its importance in the theory of computing","author":"Hartmanis","year":"1973","journal-title":"Cornell University Technical Report"},{"key":"10.1016\/S0022-0000(74)80008-5_bib14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80008-5_bib15","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/321724.321727","article-title":"A note concerning nondeterministic tape complexities","volume":"19","author":"Ibarra","year":"1972","journal-title":"J. Assoc. Comput. Mach"},{"key":"10.1016\/S0022-0000(74)80008-5_bib16","series-title":"Proc. Fourth ACM Symposium on Theory of Computing","first-page":"157","article-title":"Turing machines and the spectra of first-order formulas with equality","author":"Jones","year":"1972"},{"key":"10.1016\/S0022-0000(74)80008-5_bib17","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibilities among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0022-0000(74)80008-5_bib18","series-title":"Conf. Record IEEE Thirteenth Annual Symposium on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expression with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/S0022-0000(74)80008-5_bib19","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(74)80008-5_bib20","series-title":"Conf. Record IEEE Sixth Annual Symp. on Switching Circuit Theory and Logical Design","first-page":"173","article-title":"Translational methods and computational complexity","author":"Ruby","year":"1965"},{"key":"10.1016\/S0022-0000(74)80008-5_bib21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80008-5_bib22","series-title":"Conf. Record IEEE Fourteenth Annual Symposium on Switching and Automata Theory","first-page":"130","article-title":"Refinements of the nondeterministic time and space hierarchies","author":"Seiferas","year":"1973"},{"key":"10.1016\/S0022-0000(74)80008-5_bib23","series-title":"Conf. Record IEEE Sixth Annual Symposium on Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies of Memory limited computations","author":"Stearns","year":"1965"},{"key":"10.1016\/S0022-0000(74)80008-5_bib24","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/S0022-0000(69)80032-2","article-title":"A generator of context-sensitive languages","volume":"4","author":"Wegbreit","year":"1969","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:08Z","timestamp":1544140328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,10]]}},"alternative-id":["S0022000074800085"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80008-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,10]]}}}