{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T05:27:10Z","timestamp":1702013230384},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/bf00289616","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T00:22:58Z","timestamp":1096935778000},"page":"337-357","source":"Crossref","is-referenced-by-count":50,"title":["Deriving graphs from graphs by applying a production"],"prefix":"10.1007","volume":"4","author":[{"given":"Barry K.","family":"Rosen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"Birkhoff, G., Lipson, J. D.: Heterogeneous algebras. J. Combinatorial Theory 8, 115?133 (1970)","journal-title":"J. Combinatorial Theory"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Burge, W. H.: Stream processing functions. IBM J. Res. and Devel., to appear","DOI":"10.1147\/rd.191.0012"},{"key":"CR3","unstructured":"Ehrig, H., Mueller, F.: Graph grammar formalization and manipulation of data structures. Unpublished abstract, May 1974"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H. J.: Graph grammars: an algebraic approach. Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, Iowa City, 1973, p. 167?180","DOI":"10.1109\/SWAT.1973.11"},{"key":"CR5","volume-title":"Proc. Conf. Biologically Motivated Automata Theory","author":"H. Ehrig","year":"1974","unstructured":"Ehrig, H., Tischer, K. W.: Graphs grammars for the specialization of organisms. Proc. Conf. Biologically Motivated Automata Theory, MITRE Corp., McLean (Virginia), June 1974"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Goguen, J. A., Thatcher, J. W.: Initial algebra semantics. Proc 15th Annual IEEE Symposium on Switching and Automata Theory, New Orleans, 1974, p. 63?77","DOI":"10.1109\/SWAT.1974.13"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Maggiolo-Schettini, A., Rosen, B. K., Strong, H. R.: Procedure linkage optimzation. Working paper. Proc. ACM Symposium on Principles of Programming Languages, Boston, 1973, p. 183?193","DOI":"10.1145\/512927.512944"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","volume":"16","author":"Z. Manna","year":"1973","unstructured":"Manna, Z., Ness, S., Vuillemin, J.: Inductive methods for proving properties of programs. Comm. ACM 16, 491?502 (1973)","journal-title":"Comm. ACM"},{"key":"CR9","volume-title":"Theory of categories","author":"B. Mitchell","year":"1965","unstructured":"Mitchell, B.: Theory of categories. London-New York: Academic Press 1965"},{"key":"CR10","volume-title":"Categories and functors","author":"B. Pareigis","year":"1970","unstructured":"Pareigis, B.: Categories and functors. London-New York: Academic Press 1970"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. K. Rosen","year":"1973","unstructured":"Rosen, B. K.: Tree-manipulating systems and Church-Rosser theorems. J. ACM 20, 160?187 (1973)","journal-title":"J. ACM"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Computing 1, 146?160 (1972)","journal-title":"SIAM J. Computing"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Vuillemin, J.: Correct and optimal implementations of recursion in a simple programming language. Proc. Fifth Annual ACM Symp. on Theory of Computing, Austin (Tex.), 1973, p. 224?239","DOI":"10.1145\/800125.804054"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/S0022-0000(73)80032-7","volume":"7","author":"S. A. Walker","year":"1973","unstructured":"Walker, S. A., Strong, H. R.: Characterization of flowchartable recursions. J. Computer and System Sciences 7, 404?447 (1973)","journal-title":"J. Computer and System Sciences"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289616.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289616\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:59Z","timestamp":1554743699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1975]]}},"alternative-id":["BF00289616"],"URL":"https:\/\/doi.org\/10.1007\/bf00289616","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975]]}}}