{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:21Z","timestamp":1760202561261},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1974,4,1]],"date-time":"1974-04-01T00:00:00Z","timestamp":134006400000},"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":14352,"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":[[1974,4]]},"DOI":"10.1016\/s0022-0000(74)80058-9","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T10:37:03Z","timestamp":1199356623000},"page":"243-269","source":"Crossref","is-referenced-by-count":7,"title":["The equivalence of stack-counter acceptors and quasi-realtime stack-counter acceptors"],"prefix":"10.1016","volume":"8","author":[{"given":"Seymour","family":"Ginsburg","sequence":"first","affiliation":[]},{"given":"Gene F.","family":"Rose","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80058-9_bib1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01706072","article-title":"Multi-stack-counter languages","volume":"6","author":"Book","year":"1972","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(74)80058-9_bib2","article-title":"The Theory and Application of Pushdown Store Machines, Mathematical Linguistics and Automatic Translation","author":"Evey","year":"1963","journal-title":"Harvard University Computation Lab. Rept. NSF-10"},{"key":"10.1016\/S0022-0000(74)80058-9_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\/S0022-0000(74)80058-9_bib4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter laguages","volume":"2","author":"Fischer","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(74)80058-9_bib5","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0022-0000(74)80058-9_bib6","first-page":"1","article-title":"Abstract families of languages, \u201cStudies in Abstract Families of Languages","author":"Ginsburg","year":"1969"},{"key":"10.1016\/S0022-0000(74)80058-9_bib7","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\/S0022-0000(74)80058-9_bib8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite hierarchy of context-free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/S0022-0000(74)80058-9_bib9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/321694.321695","article-title":"Multitape AFA","volume":"19","author":"Greibach","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80058-9_bib10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u201cTag\u201d and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. of Math."},{"key":"10.1016\/S0022-0000(74)80058-9_bib11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T18:25:33Z","timestamp":1546367133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,4]]}},"alternative-id":["S0022000074800589"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80058-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,4]]}}}