{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:00:23Z","timestamp":1648998023801},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1979,6]]},"DOI":"10.1007\/bf00264016","type":"journal-article","created":{"date-parts":[[2006,2,23]],"date-time":"2006-02-23T00:38:38Z","timestamp":1140655118000},"page":"33-61","source":"Crossref","is-referenced-by-count":12,"title":["Lower bounds on space complexity for contextfree recognition"],"prefix":"10.1007","volume":"12","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF00264016_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H.: Eine untere Schranke f\u00fcr den Platzbedarf bei der Analyse beschr\u00e4nkter kontextfreier Sprachen, Dissertation, Saarbr\u00fccken, 1976","DOI":"10.1007\/3-540-08138-0_10"},{"key":"BF00264016_CR2","unstructured":"Alt, H., Mehlhorn, K.: Lower Bounds for the Space Complexity of Contextfree Recognition, 3rd Coll. on Automata, Languages and Programming, Edinburgh, 1976"},{"key":"BF00264016_CR3","doi-asserted-by":"crossref","unstructured":"Alt, H. Mehlhorn, K.: A Language over a Single Letter Alphabet requiring only O(log log n) Space. SIGACT NEWS, Vol. 7 (1975)","DOI":"10.1145\/990502.990506"},{"key":"BF00264016_CR4","unstructured":"Fredman, A.R., Ladner, E.R.: Space Bounds Processing Contentless Inputs, JCSS, 1976"},{"key":"BF00264016_CR5","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages, McGraw-Hill, 1972"},{"key":"BF00264016_CR6","doi-asserted-by":"crossref","unstructured":"Greub, W.H.: Linear Algebra, Springer-Verlag, 1967","DOI":"10.1007\/978-3-662-00672-6"},{"key":"BF00264016_CR7","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Berman, L.: A Note on Tape Bounds for SLA Languages Processing, 16th FOCS Symp., Berkeley, 1975","DOI":"10.1109\/SFCS.1975.2"},{"key":"BF00264016_CR8","volume-title":"Formal Languages and their Relation to Automata","author":"J.W. Hopcroft","year":"1969","unstructured":"Hopcroft, J.W., Ullman, J.D.: Formal Languages and their Relation to Automata, Reading, Mass.: Addison-Wesley, 1969"},{"key":"BF00264016_CR9","unstructured":"Hotz, G., Messerschmidt, J.: Dyck-Sprachen sind in Bandkomplexit\u00e4t log n analysierbar, Universit\u00e4t des Saarlandes 1974"},{"key":"BF00264016_CR10","doi-asserted-by":"crossref","unstructured":"Lewis, P.M., Hartmanis, J., Stearns, R.E.: Memory Bounds for the Recognition of Context-Free and Context-Sensitive Languages, IEEE Conf. Record on Switching Circuit Theory and Logical Dessign, 179\u2013202 (1965)","DOI":"10.1109\/FOCS.1965.14"},{"key":"BF00264016_CR11","doi-asserted-by":"crossref","unstructured":"Lynch, N.: Log Space Recognition and Translation of Paranthesis Languages, JACM 24 (1977)","DOI":"10.1145\/322033.322037"},{"key":"BF00264016_CR12","unstructured":"Mehlhorn, K.: Komplexit\u00e4tstheorie, Vorlesungsskript, WS 1975\/76, Univ. d. Saarlandes"},{"key":"BF00264016_CR13","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Bracket Languages are Recognizable in Logarithmic Space, Information Processing Letters 5, 1976","DOI":"10.1016\/0020-0190(76)90013-2"},{"key":"BF00264016_CR14","doi-asserted-by":"crossref","unstructured":"Monien, B.: About the Deterministic Simulation of Nondeterministic (log n)-Tape Bounded Turing Machines, 2. GI-Fachtagung, Kaiserslautern, 1975","DOI":"10.1007\/3-540-07407-4_15"},{"key":"BF00264016_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0019-9958(72)90205-7","volume":"4","author":"Ritchie Springsteel","year":"1972","unstructured":"Springsteel, Ritchie: Language Recognition by Marking Automata, Information and Control, 4, 313\u2013330 (1972)","journal-title":"Information and Control"},{"key":"BF00264016_CR16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","volume":"11","author":"R.E. Stearns","year":"1967","unstructured":"Stearns, R.E.: A Regularity Test for Pushdown-Machines, Information and Control, 11, 323\u2013340 (1967)","journal-title":"Information and Control"},{"key":"BF00264016_CR17","doi-asserted-by":"crossref","unstructured":"Sudborough, I.H.: On Tape Bounded Classes and Multihead Finite Automata, 14th SWAT Symp., 138\u2013144 (1973)","DOI":"10.1109\/SWAT.1973.20"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264016.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264016\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T22:05:31Z","timestamp":1555452331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["BF00264016"],"URL":"https:\/\/doi.org\/10.1007\/bf00264016","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}