{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T07:02:33Z","timestamp":1648623753046},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13468,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1976,9]]},"DOI":"10.1016\/0304-3975(76)90082-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"295-304","source":"Crossref","is-referenced-by-count":4,"title":["On the pre-AFL of [log n] space and related families of languages"],"prefix":"10.1016","volume":"2","author":[{"given":"Fred Neil","family":"Springsteel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90082-7_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","article-title":"Quasi-realtime languages","volume":"4","author":"Book","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90082-7_BIB2","first-page":"187","article-title":"Context-free grammars and push-down storage","volume":"65","author":"Chomsky","year":"1962","journal-title":"Quart. Progress Report"},{"key":"10.1016\/0304-3975(76)90082-7_BIB3","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","article-title":"Turing machines with restricted memory access","volume":"9","author":"Fischer","year":"1966","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90082-7_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fischer","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90082-7_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/321172.321179","article-title":"Syntactic analysis and operator precedence","volume":"10","author":"Floyd","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90082-7_BIB6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/363921.363927","article-title":"Bounded context analysis","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90082-7_BIB7","first-page":"241","article-title":"On the largest full sub-AFL of an AFL","volume":"6","author":"Ginsburg","year":"1972","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90082-7_BIB8","series-title":"Studies in AFLs","article-title":"Pre-AFL","volume":"87","author":"Ginsburg","year":"1969"},{"key":"10.1016\/0304-3975(76)90082-7_BIB9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","article-title":"A new normal form theorem for CF phrase-structure grammars","volume":"12","author":"Greibach","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90082-7_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01691341","article-title":"A note on undecidable properties of formal languages","volume":"2","author":"Greibach","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90082-7_BIB11","unstructured":"J. Hartmanis and J. Hopcroft, What makes some language theory problems undecidable, Tech. Rept. #69-45, Computer Science Department, Cornell Univ."},{"key":"10.1016\/0304-3975(76)90082-7_BIB12","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(76)90082-7_BIB13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(68)91096-6","article-title":"Classes of automata and transitive closure","volume":"13","author":"Jones","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90082-7_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/malq.19660120120","article-title":"A basis theorem for a class of two-way automata","volume":"12","author":"Kreider","year":"1966","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0304-3975(76)90082-7_BIB15","first-page":"191","article-title":"Memory bounds for recognition of CFLs and CSLs","author":"Lewis","year":"1965","journal-title":"IEEE Proc. 6th SWAT Symp."},{"key":"10.1016\/0304-3975(76)90082-7_BIB16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0019-9958(72)90205-7","article-title":"Language recognition by marking automata","volume":"20","author":"Ritchie","year":"1972","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90082-7_BIB17","series-title":"Ph.D. Dissertation","article-title":"Context-free Languages and Marking Automata","author":"Springsteel","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:21:21Z","timestamp":1555125681000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,9]]}},"alternative-id":["0304397576900827"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90082-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}