{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T21:53:08Z","timestamp":1672609988570},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1977,12]]},"DOI":"10.1007\/bf01768464","type":"journal-article","created":{"date-parts":[[2005,6,17]],"date-time":"2005-06-17T16:07:35Z","timestamp":1119024455000},"page":"1-8","source":"Crossref","is-referenced-by-count":20,"title":["Inclusion complete tally languages and the Hartmanis-Berman conjecture"],"prefix":"10.1007","volume":"11","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celia","family":"Wrathall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Dobkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01768464_CR1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","volume":"26","author":"R. Book","year":"1974","unstructured":"R. Book, Tally languages and complexity classes,Information and Control 26 (1974), 186\u2013193.","journal-title":"Information and Control"},{"key":"BF01768464_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(74)80008-5","volume":"9","author":"R. Book","year":"1974","unstructured":"R. Book, Comparing complexity classes,J. Computer System Sci. 9 (1974), 213\u2013229.","journal-title":"J. Computer System Sci."},{"key":"BF01768464_CR3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(76)90057-8","volume":"1","author":"R. Book","year":"1976","unstructured":"R. Book, Translational lemmas, polynomial time, and (logn)j-space,Theoretical Computer Sci. 1 (1976), 215\u2013226.","journal-title":"Theoretical Computer Sci."},{"key":"BF01768464_CR4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"S. Cook","year":"1971","unstructured":"S. Cook, Characterizations of pushdown machines in terms of time-bounded computers,J. Assoc. Comput. Mach. 18 (1971), 4\u201318.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01768464_CR5","doi-asserted-by":"crossref","unstructured":"J. Hartmanis and L. Berman, On isomorphisms and density ofNP and other complete sets,Cornell University Technical Report TR 75-260 and Proc. Eighth ACM Symp. Theory of Computing (1976); 30\u201340.","DOI":"10.1145\/800113.803628"},{"key":"BF01768464_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/2272354","volume":"39","author":"N. Jones","year":"1974","unstructured":"N. Jones andA. Selman, Turing machines and the spectra of first-order formulas,J. Symbolic Logic 39 (1974), 139\u2013150.","journal-title":"J. Symbolic Logic"},{"key":"BF01768464_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Lander","year":"1975","unstructured":"R. Lander, On the structure of polynomial time reducibility,J. Assoc. Comput. Mach 22 (1975), 155\u2013171.","journal-title":"J. Assoc. Comput. Mach"},{"key":"BF01768464_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Lander","year":"1975","unstructured":"R. Lander, N. Lynch, andA. Selman, A comparison of polynomial time reducibilities,Theoretical Computer Sci. 1 (1975), 103\u2013123.","journal-title":"Theoretical Computer Sci."},{"key":"BF01768464_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. Savitch","year":"1970","unstructured":"W. Savitch, Relationships between nondeterministic and deterministic tape complexities,J. Computer System Sci. 4 (1970), 177\u2013192.","journal-title":"J. Computer System Sci."},{"key":"BF01768464_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF00289080","volume":"2","author":"W. Savitch","year":"1973","unstructured":"W. Savitch, A note on multihead and context-sensitive languages,Acta Informatica 2 (1973), 249\u2013252.","journal-title":"Acta Informatica"},{"key":"BF01768464_CR11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"S. Sahni, Computationally related problems,SIAM J. Computing 3 (1974), 262\u2013279.","journal-title":"SIAM J. Computing"},{"key":"BF01768464_CR12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni, andT. Gonzaiez,P-complete approximation problems,J. Assoc. Comput. Mach. 23 (1976), 555\u2013565.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01768464_CR13","unstructured":"C. Wrathall,Subrecursive Predicates and Automata, Ph.D. Dissertation, Harvard University, 1975."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01768464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01768464\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01768464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T20:04:51Z","timestamp":1586289891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01768464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01768464"],"URL":"https:\/\/doi.org\/10.1007\/bf01768464","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}