{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:26Z","timestamp":1725456266961},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354050110X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017167","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:30:09Z","timestamp":1132727409000},"page":"445-453","source":"Crossref","is-referenced-by-count":4,"title":["Two applications of f\u00fcrer's counter to one-tape nondeterministic TMs"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Lory\u015b","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","volume":"4","author":"R.V. Book","year":"1970","unstructured":"R.V. Book and S.A. Greibach, Quasi-realtime languages, Math. Sys. Theory, 4(1970), pp.97\u2013111","journal-title":"Math. Sys. Theory"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"M. F\u00fcrer, The tight deterministic time hierarchy, Proc. 14th Annual ACM Symposium on Theory of Computing, (1982), pp.8\u201316","DOI":"10.1145\/800070.802172"},{"key":"41_CR3","unstructured":"J. Hartmanis, Size arguments in the study of computation speeds, Proc. Symp. on Computers and Automata, Polytechn. Inst. Brooklyn, (1965)"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1145\/321466.321474","volume":"15","author":"J.E. Hopcroft","year":"1968","unstructured":"J.E. Hopcroft and J.D. Ullman, Relations between time and tape complexities, J. Assoc. Comp. Mach., 15 (1968), pp.414\u2013427","journal-title":"J. Assoc. Comp. Mach."},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/0212025","volume":"12","author":"O.H. Ibarra","year":"1983","unstructured":"O.H. Ibarra and S. Moran, Some time-space tradeoffs results concerning single-tape and offline TMs, SIAM J. Comput., 12(1983), pp.388\u2013394","journal-title":"SIAM J. Comput."},{"key":"41_CR6","series-title":"Report","volume-title":"Fast simulations of time-bounded TMs by space-bounded ones","author":"M. Li\u015bkiewicz","year":"1987","unstructured":"M. Li\u015bkiewicz and K. Lory\u015b, Fast simulations of time-bounded TMs by space-bounded ones, Report N-187, Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw 1987"},{"key":"41_CR7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(79)90028-X","volume":"19","author":"W.J. Paul","year":"1979","unstructured":"W.J. Paul, On time hierarchies, J. Comput. Systems Sci., 19(1979), pp.197\u2013202","journal-title":"J. Comput. Systems Sci."},{"key":"41_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264255","volume":"14","author":"W.J. Paul","year":"1980","unstructured":"W.J. Paul, E.J. Prauss and R. Reischuk, On alternation I, Acta Informatica, 14(1980), pp.243\u2013255","journal-title":"Acta Informatica"},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0022-0000(72)80017-5","volume":"6","author":"M.S. Paterson","year":"1972","unstructured":"M.S. Paterson, Tape bounds for time-bounded Turing machines, J. Comput. Systems Sci., 6(1972), pp.116\u2013124","journal-title":"J. Comput. Systems Sci."},{"key":"41_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/322047.322061","volume":"25","author":"J.I. Seiferas","year":"1978","unstructured":"J.I. Seiferas, M.J. Fischer and A.R. Meyer, Separating nondeterministic time complexity classes, J. Assoc. Comp. Mach., 25(1978), pp.146\u2013167.","journal-title":"J. Assoc. Comp. Mach."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1988"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017167.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:37:43Z","timestamp":1607549863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354050110X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0017167","relation":{},"subject":[]}}