{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:34Z","timestamp":1725456994367},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032026","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"111-124","source":"Crossref","is-referenced-by-count":1,"title":["Nondeterministic computations in sublogarithmic space and space constructibility"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0022-0000(75)80052-3","volume":"11","author":"A.R. Freedman","year":"1975","unstructured":"A.R. Freedman,R.E. Ladner: Space bounds for processing counterless inputs, Journal of Computer and System Sciences, 11:118\u2013128, 1975","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"M.A.Harrison: Introduction to formal language theory, Addison-Wesley Pub.Co., 1978","key":"10_CR2"},{"key":"10_CR3","first-page":"49","volume":"379","author":"J. Hartmanis","year":"1989","unstructured":"J. Hartmanis,D. Ranjan: Space bounded Computations: Review and new separation results, Proceeding of MFCS'89, LNCS 379, Springer-Verlag, 1989, 49\u201366","journal-title":"LNCS"},{"key":"10_CR4","volume-title":"Formal languages and their relation to automata","author":"J.E. Hopcroft","year":"1969","unstructured":"J.E. Hopcroft,J.D. Ullman: Formal languages and their relation to automata, Addison-Wesley Pub.Co., Reading Mass., 1969"},{"doi-asserted-by":"crossref","unstructured":"N.Immerman: Nondeterministic space is closed under complement, Proceeding of Structure in Complexity Theory, 3rd Annual Conference, 112\u2013115, Comput. Society of IEEE, 1988","key":"10_CR5","DOI":"10.1109\/SCT.1988.5270"},{"doi-asserted-by":"crossref","unstructured":"P.M.Lewis II,R.E.Stearns,J.Hartmanis: Memory bounds for recognition of context-free and context-sensitive languages, IEEE Conference Record on Switching Circuit Theory and Logical Design, 191\u2013202, 1965","key":"10_CR6","DOI":"10.1109\/FOCS.1965.14"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"W.J. Savitch: Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, 4:177\u2013192, 1970","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Seiferas: A note on notions of tape constructibility, Technical Report CSD-TR 187, Pennsylvania State University, 1976","key":"10_CR8"},{"doi-asserted-by":"crossref","unstructured":"R.E.Stearns,J.Hartmanis,P.M.Lewis II: Hierarchies of memory limited computations, IEEE Conference Record on Switching Circuit Theory and Logical Design, 179\u2013190, 1965","key":"10_CR9","DOI":"10.1109\/FOCS.1965.11"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R. Szelepcs\u00e9nyi","year":"1988","unstructured":"R. Szelepcs\u00e9nyi: The method of forced enumeration for nondeterministic automata, Acta Informatica, 26,279\u2013284(1988)","journal-title":"Acta Informatica"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1980","unstructured":"M. Sipser: Halting space-bounded computations, Theoretical Computer Science, 10:335\u2013338,1980","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:14Z","timestamp":1586612714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0032026","relation":{},"subject":[]}}