{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T05:50:14Z","timestamp":1757569814633},"reference-count":41,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"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":10455,"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":[[1984,12]]},"DOI":"10.1016\/0022-0000(84)90006-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"366-408","source":"Crossref","is-referenced-by-count":10,"title":["Extended macro grammars and stack controlled machines"],"prefix":"10.1016","volume":"29","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giora","family":"Slutzki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90006-0_BIB1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars\u2014An extension of context-free grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90006-0_BIB2","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(84)90006-0_BIB3","first-page":"5","article-title":"Transductions de for\u00eats reconnaissables monadiques; for\u00eats cor\u00e9guli\u00e8res","volume":"IT-10","author":"Arnold","year":"1976","journal-title":"Rev. Fran\u00e7aise Automat. Informat. Rech. Oper."},{"key":"10.1016\/0022-0000(84)90006-0_BIB4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/S0019-9958(77)90308-4","article-title":"Controlled iteration grammars and full hyper-AFLs","volume":"34","author":"Asveld","year":"1977","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(84)90006-0_BIB5","article-title":"Iterated Context-independent Rewriting\u2014An Algebraic Approach to Families of Languages","author":"Asveld","year":"1978"},{"key":"10.1016\/0022-0000(84)90006-0_BIB6","series-title":"Generalizations of context-free grammars and the nonself-embedding property","author":"Asveld","year":"1980"},{"key":"10.1016\/0022-0000(84)90006-0_BIB7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF00289071","article-title":"Extended linear macro grammars, iteration grammars, and register programs","volume":"11","author":"Asveld","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(84)90006-0_BIB8","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0022-0000(84)90006-0_BIB9","article-title":"Formal Languages and Recursion Schemes","author":"Downey","year":"1974"},{"key":"10.1016\/0022-0000(84)90006-0_BIB10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(76)90076-1","article-title":"A relationship between ETOL languages and EDTOL languages","volume":"1","author":"Ehrenfeucht","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90006-0_BIB11","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0022-0000(84)90006-0_BIB12","series-title":"Automata, Languages, and Programming","first-page":"221","article-title":"Macro grammars, Lindenmayer systems, and other copying devices","author":"Engelfriet","year":"1977"},{"key":"10.1016\/0022-0000(84)90006-0_BIB13","article-title":"Hierarchies of hyper-AFLs","author":"Engelfriet","year":"1982"},{"key":"10.1016\/0022-0000(84)90006-0_BIB39","unstructured":"J. Comput. System Sci., in press."},{"key":"10.1016\/0022-0000(84)90006-0_BIB14_1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI, I","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90006-0_BIB14_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","article-title":"IO and OI, II","volume":"16","author":"Engelfriet","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90006-0_BIB15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/322169.322178","article-title":"Stack machines and classes of non-nested macro languages","volume":"27","author":"Engelfriet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90006-0_BIB16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0019-9958(79)90635-1","article-title":"Bounded nesting in macro grammars","volume":"42","author":"Engelfriet","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(84)90006-0_BIB17","article-title":"The Characterization of Some Families of Languages by Classes of Indexed Grammars","author":"Fil\u00e8","year":"1977"},{"key":"10.1016\/0022-0000(84)90006-0_BIB18","series-title":"PhD thesis","first-page":"131","article-title":"Grammars with Macro-like Productions","author":"Fischer","year":"1968"},{"key":"10.1016\/0022-0000(84)90006-0_BIB19","series-title":"Proc. 10th Ann. Sympos. on Switching and Automata Theory","first-page":"157","article-title":"On the representation of formal languages using automata on networks","author":"Fisher","year":"1969"},{"key":"10.1016\/0022-0000(84)90006-0_BIB20","series-title":"Algebraic and Automata-theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0022-0000(84)90006-0_BIB21","series-title":"Studies in Abstract Families of Languages","first-page":"1","article-title":"Abstract families of languages","author":"Ginsburg","year":"1969"},{"key":"10.1016\/0022-0000(84)90006-0_BIB22","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(84)90006-0_BIB23","series-title":"Proc. of A Conference on Theoretical Computer Science","first-page":"239","article-title":"Automata with data storage","author":"Goldstine","year":"1977"},{"key":"10.1016\/0022-0000(84)90006-0_BIB24","series-title":"6th Colloq. on Automata, Languages, and Programming","first-page":"271","article-title":"A rational theory of AFLs","author":"Goldstine","year":"1979"},{"key":"10.1016\/0022-0000(84)90006-0_BIB25","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Formal languages and their relation to automata: what Hopcroft & Ullman didn't tell us","author":"Goldstine","year":"1980"},{"key":"10.1016\/0022-0000(84)90006-0_BIB26","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFLs and nested iterated substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(84)90006-0_BIB27","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(84)90006-0_BIB28","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01691106","article-title":"Chains of full AFLs","volume":"4","author":"Greibach","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90006-0_BIB29","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 Techn. J."},{"key":"10.1016\/0022-0000(84)90006-0_BIB30","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\/0022-0000(84)90006-0_BIB31","first-page":"255","article-title":"On the interpretation of recursive program schemes","volume":"15","author":"Nivat","year":"1975"},{"key":"10.1016\/0022-0000(84)90006-0_BIB32","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0022-0000(84)90006-0_BIB33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/00207167908803152","article-title":"On acceptors of iteration languages","volume":"7","author":"Rozenberg","year":"1979","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0022-0000(84)90006-0_BIB34_1","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v2i18.6437","article-title":"Macros, iterated substitution and Lindenmayer AFLs","author":"Salomaa","year":"1973"},{"key":"10.1016\/0022-0000(84)90006-0_BIB34_2","series-title":"abstract in \u201cLSystems\u201d","first-page":"250","author":"Salomaa","year":"1974"},{"key":"10.1016\/0022-0000(84)90006-0_BIB35","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0022-0000(67)80014-X","article-title":"Some definitional suggestions for automata theory","volume":"1","author":"Scott","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90006-0_BIB36","article-title":"F-iteration languages","author":"Van Leeuwen","year":"1973"},{"key":"10.1016\/0022-0000(84)90006-0_BIB37","series-title":"Automata, Languages, and Programming, 2nd Colloq.","first-page":"17","article-title":"A generalization of Parikh's theorem in formal language theory","author":"Van Leeuwen","year":"1974"},{"key":"10.1016\/0022-0000(84)90006-0_BIB38","series-title":"Conf. Record 17th Ann. IEEE Sympos. on Foundations of Computer Science","first-page":"228","article-title":"Variations of a new machine model","author":"Van Leeuwen","year":"1976"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900060?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900060?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:56Z","timestamp":1550307116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["0022000084900060"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90006-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}