{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:41:04Z","timestamp":1648622464862},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,12,1]],"date-time":"1975-12-01T00:00:00Z","timestamp":186624000000},"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":13743,"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,12]]},"DOI":"10.1016\/s0022-0000(75)80057-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"358-374","source":"Crossref","is-referenced-by-count":19,"title":["Program equivalence and context-free grammars"],"prefix":"10.1016","volume":"11","author":[{"given":"Barry K.","family":"Rosen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80057-2_bib1","volume":"Vol. 2","author":"Aho","year":"1973"},{"key":"10.1016\/S0022-0000(75)80057-2_bib2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/321765.321780","article-title":"Decidable properties of monadic functional schemas","volume":"20","author":"Ashcroft","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(75)80057-2_bib3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0201006","article-title":"On classes of program schemata","volume":"1","author":"Constable","year":"1972","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0022-0000(75)80057-2_bib4","article-title":"Formal languages and recursion schemes","author":"Downey","year":"1974"},{"key":"10.1016\/S0022-0000(75)80057-2_bib5","series-title":"Automata, Languages and Programming","first-page":"215","article-title":"Translation of simple program schemes","author":"Engelfriet","year":"1973"},{"key":"10.1016\/S0022-0000(75)80057-2_bib6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes, and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80057-2_bib7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0022-0000(69)80027-9","article-title":"Regular expressions and the equivalence of programs","volume":"3","author":"Kaplan","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80057-2_bib8","series-title":"Proceedings of the 5th Annual Princeton Conference on Information Science and Systems","first-page":"301","article-title":"A solvable program-schema equivalence problem","author":"Keller","year":"1971"},{"key":"10.1016\/S0022-0000(75)80057-2_bib9","series-title":"ACM Symposium on Principles of Programming Languages","first-page":"194","article-title":"A unified approach to global program optimization","author":"Kildall","year":"1973"},{"key":"10.1016\/S0022-0000(75)80057-2_bib10","series-title":"ACM Symposium on Principles of Programming Languages","first-page":"125","article-title":"Recursively defined data types, Part 1","author":"Lewis","year":"1973"},{"key":"10.1016\/S0022-0000(75)80057-2_bib11","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0022-0000(70)80022-8","article-title":"On formalized computer programs","volume":"4","author":"Luckham","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80057-2_bib12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","article-title":"Inductive methods for proving properties of programs","volume":"16","author":"Manna","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(75)80057-2_bib13","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"Basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/S0022-0000(75)80057-2_bib14","series-title":"Proceedings of the ACM Conf. on Concurrent Systems and Parallel Computation","first-page":"119","article-title":"Comparative schematalogy","author":"Paterson","year":"1970"},{"key":"10.1016\/S0022-0000(75)80057-2_bib15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(75)80057-2_bib16","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","article-title":"Properties of deterministic top-down grammars","volume":"17","author":"Rosenkrantz","year":"1970","journal-title":"Inform. Contr."},{"key":"10.1016\/S0022-0000(75)80057-2_bib17","series-title":"Second Annual ACM Symposium on Theory of Computing","first-page":"109","article-title":"Tree-oriented proofs of some theorems on context-free and indexed languages","author":"Rounds","year":"1970"},{"key":"10.1016\/S0022-0000(75)80057-2_bib18","series-title":"Proceedings of the 4th annual Princeton Conference on Information Science and Systems","first-page":"169","article-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1970"},{"key":"10.1016\/S0022-0000(75)80057-2_bib19","series-title":"Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory","first-page":"1","article-title":"High level languages of maximum power","author":"Strong","year":"1971"},{"key":"10.1016\/S0022-0000(75)80057-2_bib20","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0022-0000(71)80036-3","article-title":"Translating recursion equations into flow charts","volume":"5","author":"Strong","year":"1951","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80057-2_bib21","series-title":"Proceedings of the 5th Annual ACM Symposium on Theory of Computing","first-page":"224","article-title":"Correct and optimal implementations of recursion in a simple programming language","author":"Vuillemin","year":"1973"},{"key":"10.1016\/S0022-0000(75)80057-2_bib22","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/S0022-0000(73)80032-7","article-title":"Characterizations of flowchartable recursions","volume":"7","author":"Walker","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(75)80057-2_bib23","series-title":"ACM Symposium on Theory of Computing","first-page":"211","article-title":"Formal models for some features of programming languages","author":"Zeiger","year":"1969"},{"key":"10.1016\/S0022-0000(75)80057-2_bib24","series-title":"Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory","first-page":"7","article-title":"Program equivalence and context-free grammars","author":"Rosen","year":"1972"},{"key":"10.1016\/S0022-0000(75)80057-2_bib25","series-title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing","first-page":"13","article-title":"Semantics and axiomatics of a simple recursive language","author":"Courcelle","year":"1974"},{"key":"10.1016\/S0022-0000(75)80057-2_bib26","series-title":"Proceedings of the 15th Annual IEEE Symposium on Switching and Automata Theory","first-page":"52","article-title":"Recursive schemes, algebraic trees, and deterministic languages","author":"Courcelle","year":"1974"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:54:44Z","timestamp":1544140484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,12]]}},"alternative-id":["S0022000075800572"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80057-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,12]]}}}