{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:52:29Z","timestamp":1672739549607},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"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":[[1981,11]]},"DOI":"10.1007\/bf00289308","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T23:28:19Z","timestamp":1096932499000},"page":"303-308","source":"Crossref","is-referenced-by-count":11,"title":["?-productions in context-free grammars"],"prefix":"10.1007","volume":"16","author":[{"given":"Leslie M.","family":"Goldschlager","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","volume":"9","author":"S.A. Cook","year":"1974","unstructured":"Cook, S.A.: An observation on time-storage trade off. J. Comput. Systems Sci., 9, 308?316 (1974)","journal-title":"J. Comput. Systems Sci."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0020-0190(79)90152-2","volume":"8","author":"D. Dobkin","year":"1979","unstructured":"Dobkin, D., Lipton, R.J., Reiss, S.: Linear programming is log-space hard for 308-01. Information Processing Lett., 8, 96?97 (1979)","journal-title":"Information Processing Lett."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00263744","volume":"6","author":"Z. Galil","year":"1976","unstructured":"Galil, Z.: Hierarchies of complete problems. Acta Informat., 6, 77?88 (1976)","journal-title":"Acta Informat."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Goldschlager, L.M.: A unified approach to models of synchronous parallel machines. Proc. 10th Annual ACM Symp. on Theory of Computing, pp. 89?94, 1978","DOI":"10.1145\/800133.804336"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"L.M. Goldschlager","year":"1977","unstructured":"Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for 308-02. SIGACT News, 9, 25?29 (1977)","journal-title":"SIGACT News"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(80)90117-9","volume":"10","author":"L.M. Goldschlager","year":"1980","unstructured":"Goldschlager, L.M.: A space efficient algorithm for the monotone planar circuit value problem. Information Processing Lett., 10, 25?27 (1980)","journal-title":"Information Processing Lett."},{"key":"CR7","volume-title":"Formal languages and their relation to automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Reading, Mass.: Addison-Wesley 1969"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N.D. Jones","year":"1977","unstructured":"Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theor. Comput. Sci., 3, 105?117 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","volume":"7","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: The circuit value problem is log space complete for 308-03. SIGACT News, 7, 18?20 (1975)","journal-title":"SIGACT News"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Lewis, P.M., Stearns, R.E., Hartmanis, J.: Memory bounds for recognition of context-free and context-sensitive languages. IEEE Conference Record on Switching Circuit Theory and Logical Design. pp. 191?202, 1965","DOI":"10.1109\/FOCS.1965.14"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289308.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289308\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:47Z","timestamp":1554743687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["BF00289308"],"URL":"https:\/\/doi.org\/10.1007\/bf00289308","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}