{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:44:35Z","timestamp":1649072675658},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,6,1]],"date-time":"1975-06-01T00:00:00Z","timestamp":170812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":13957,"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":[[1975,6]]},"DOI":"10.1016\/s0022-0000(75)80009-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"394-427","source":"Crossref","is-referenced-by-count":2,"title":["Abstract families of length-preserving processors"],"prefix":"10.1016","volume":"10","author":[{"given":"Sister Teresemarie","family":"McCloskey","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80009-2_bib1","series-title":"IEEE Conference Record on Switching and Automata Theory","first-page":"128","article-title":"Abstract families of languages","author":"Ginsburg","year":"1967"},{"key":"10.1016\/S0022-0000(75)80009-2_bib2","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1002\/j.1538-7305.1967.tb03172.x","article-title":"An approach to a unified theory of automata","volume":"46","author":"Hopcroft","year":"1967","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0022-0000(75)80009-2_bib3","unstructured":"S. Ginsburg, \u201cAlgebraic and Automata-Theoretic Properties of Formal Languages,\u201d North-Holland, Amsterdam, in press."},{"key":"10.1016\/S0022-0000(75)80009-2_bib4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0022-0000(70)80020-4","article-title":"Abstract families of processors","volume":"4","author":"Rose","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80009-2_bib5","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/S0022-0000(69)80017-6","article-title":"Writing pushdown acceptors","volume":"3","author":"Mager","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80009-2_bib6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S0022-0000(72)80021-7","article-title":"Writing stack acceptors","volume":"6","author":"Giuliano","year":"1972","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0022-0000(75)80009-2_bib7","unstructured":"G. F. Rose, Unpublished seminar notes and communications, 1969, 1970."},{"key":"10.1016\/S0022-0000(75)80009-2_bib8","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","article-title":"Principal AFL","volume":"4","author":"Ginsburg","year":"1970","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0022-0000(75)80009-2_bib9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0020-0255(70)90037-X","article-title":"On the existence of generators for certain AFL","volume":"2","author":"Ginsburg","year":"1970","journal-title":"Inform. Sci."},{"key":"10.1016\/S0022-0000(75)80009-2_bib10","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/321420.321421","article-title":"Programming languages for automata","volume":"14","author":"Knuth","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(75)80009-2_bib11","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/S0022-0000(69)80032-2","article-title":"A generator of context-sensitive languages","volume":"3","author":"Wegbreit","year":"1969","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0022-0000(75)80009-2_bib12","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\/S0022-0000(75)80009-2_bib13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/321556.321558","article-title":"Two-way ballon automata and AFL","volume":"17","author":"Ginsburg","year":"1970","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(75)80009-2_bib14","author":"Hopcroft","year":"1969"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800092?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:54:52Z","timestamp":1544122492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,6]]}},"alternative-id":["S0022000075800092"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80009-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,6]]}}}