{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:15:00Z","timestamp":1648628100653},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"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":12647,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1978,12]]},"DOI":"10.1016\/0022-0000(78)90010-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"281-299","source":"Crossref","is-referenced-by-count":6,"title":["Stack languages and log n space"],"prefix":"10.1016","volume":"17","author":[{"given":"K.N.","family":"King","sequence":"first","affiliation":[]},{"given":"C.","family":"Wrathall","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90010-7_BIB1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","article-title":"Nested stack automata","volume":"16","author":"Aho","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90010-7_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(76)90057-8","article-title":"Translational lemmas, polynomial time, and (log n)j-space","volume":"1","author":"Book","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0022-0000(78)90010-7_BIB3","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\/0022-0000(78)90010-7_BIB4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321371.321385","article-title":"Stack automata and compiling","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90010-7_BIB5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90010-7_BIB6","first-page":"41","article-title":"Pre-AFL","author":"Ginsburg","year":"1969"},{"key":"10.1016\/0022-0000(78)90010-7_BIB7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","article-title":"Checking automata and one-way stack languages","volume":"3","author":"Greibach","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90010-7_BIB8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0019-9958(68)90722-5","article-title":"Sets accepted by one-way stack automata are context sensitive","volume":"13","author":"Hopcroft","year":"1968","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90010-7_BIB9","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0022-0000(78)90010-7_BIB10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(71)80029-6","article-title":"Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata","volume":"5","author":"Ibarra","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90010-7_BIB11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","article-title":"On two-way multihead automata","volume":"7","author":"Ibarra","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90010-7_BIB12_1","first-page":"29","article-title":"Rudimentary interpretation of two-tape Turing computation","volume":"6","author":"Nepomnyashchh","year":"1970","journal-title":"Kibernetika"},{"key":"10.1016\/0022-0000(78)90010-7_BIB12_2","first-page":"43","article-title":"Rudimentary interpretation of two-tape Turing computation","author":"Nepomnyashchh","year":"1972","journal-title":"Cybernetics"},{"key":"10.1016\/0022-0000(78)90010-7_BIB13","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":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90010-7_BIB14","series-title":"IEEE Conference Record of the Fourteenth Annual Symposium on Switching and Automata Theory","first-page":"145","article-title":"Complexity of recognition in intermediate-level languages","author":"Rounds","year":"1973"},{"key":"10.1016\/0022-0000(78)90010-7_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90010-7_BIB16","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90010-7_BIB17","first-page":"53","article-title":"Characterizations of the Dyck sets","volume":"11","author":"Wrathall","year":"1977","journal-title":"RAIRO"},{"key":"10.1016\/0022-0000(78)90010-7_BIB18","unstructured":"C. WRATHALL, Remarks on languages, relations and automata, in preparation."},{"key":"10.1016\/0022-0000(78)90010-7_BIB19","article-title":"Rudimentary Relations and Formal Languages","author":"Yu","year":"1970"},{"key":"10.1016\/0022-0000(78)90010-7_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(68)80003-0","article-title":"Deterministic stack automata and the quotient operator","volume":"2","author":"Hopcroft","year":"1968","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:28:45Z","timestamp":1550323725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["0022000078900107"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90010-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}