{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:31Z","timestamp":1747579531252},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01752403","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T10:43:16Z","timestamp":1118832196000},"page":"305-334","source":"Crossref","is-referenced-by-count":44,"title":["Transformations of structures: An algebraic approach"],"prefix":"10.1007","volume":"14","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Maggiolo-Schettini","sequence":"additional","affiliation":[]},{"given":"Barry K.","family":"Rosen","sequence":"additional","affiliation":[]},{"given":"Jozef","family":"Winkowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01752403_CR1","volume-title":"Arrows, Structures, and Functors","author":"M. A. Arbib","year":"1975","unstructured":"M. A. Arbib and E. G. Manes,Arrows, Structures, and Functors, Academic Press, New York, 1975."},{"key":"BF01752403_CR2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","volume":"26","author":"G. Berry","year":"1979","unstructured":"G. Berry and J.-J. Levy, Minimal and optimal computations of recursive programs,J. ACM 26 (1979), 148\u2013175.","journal-title":"J. ACM"},{"key":"BF01752403_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"G. Birkhoff and J. D. Lipson, Heterogeneous algebras,J. Combinatorial Theory, 8 (1970), pp. 115\u2013133.","journal-title":"J. Combinatorial Theory"},{"key":"BF01752403_CR4","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, and G. Rozenberg (Editors),Graph Grammars and their Application to Computer Science and Biology, Lecture Notes in Computer Sci., 73 (1979).","DOI":"10.1007\/BFb0025713"},{"key":"BF01752403_CR5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E. F. Codd","year":"1970","unstructured":"E. F. Codd,A relational model of data for large shared data banks, Comm. ACM, 13 (1970), pp. 377\u2013387.","journal-title":"Comm. ACM"},{"key":"BF01752403_CR6","doi-asserted-by":"crossref","unstructured":"J. A. Darringer and W. H. Joyner,A new look at logic synthesis, IBM Research Report RC 8268, Yorktown Heights NY, May 1980.","DOI":"10.1145\/800139.804583"},{"key":"BF01752403_CR7","unstructured":"H. Ehrig and H.-J. Kreowski, Contributions to the algebraic theory of graph grammars,Math. Nachr., to appear."},{"key":"BF01752403_CR8","unstructured":"H. Ehrig and H.-J. Kreowski, Applications of graph grammar theory to consistency, synchronization, and scheduling in data base systems,Information Sciences, to appear."},{"key":"BF01752403_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-08921-7_66","volume":"64","author":"H. Ehrig","year":"1978","unstructured":"H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B. K. Rosen, and J. Winkowski, Deriving structures from structures,Lecture Notes in Computer Science, 64 (1978), pp. 177\u2013190.","journal-title":"Lecture Notes in Computer Science"},{"key":"BF01752403_CR10","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender, and H. J. Schneider, Graph grammars: an algebraic approach,Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory, Iowa City, October 1973, pp. 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"BF01752403_CR11","unstructured":"H. Ehrig and B. K. Rosen,Commutativity of independent transformations on complex objects, IBM Research Report RC 6251, Yorktown Heights NY, October 1976."},{"key":"BF01752403_CR12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0209034","volume":"9","author":"H. Ehrig","year":"1980","unstructured":"H. Ehrig and B. K. Rosen, The mathematics of record handling,SIAM J. Computing, 9 (1980), 441\u2013469.","journal-title":"SIAM J. Computing"},{"key":"BF01752403_CR13","unstructured":"H. Ehrig and B. K. Rosen,Commutativity, parallelism, and concurrency for transformations of structures, Bericht 79\u201321, Fachbereich Informatik, Tech. U. Berlin, October 1979."},{"key":"BF01752403_CR14","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0022-0000(75)80069-9","volume":"11","author":"H. Ehrig","year":"1975","unstructured":"H. Ehrig and K. W. Tischer, Graph grammars and applications to specialization and evolution in biology,J. Computer and System Sci., 11 (1975), pp. 212\u2013236.","journal-title":"J. Computer and System Sci."},{"key":"BF01752403_CR15","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","volume":"11","author":"S. Eilenberg","year":"1967","unstructured":"S. Eilenberg and J. Wright, Automata in general algebras,Information and Control, 11 (1967), 452\u2013470.","journal-title":"Information and Control"},{"key":"BF01752403_CR16","doi-asserted-by":"crossref","unstructured":"R. Farrow, K. Kennedy, and L. Zucconi, Graph grammars and global program data flow analysis,Proc. 17th Ann. IEEE Symp. on Foundations of Computer Sci., Houston, October 1976, pp. 42\u201356.","DOI":"10.1109\/SFCS.1976.17"},{"key":"BF01752403_CR17","volume-title":"Category Theory","author":"H. Herrlich","year":"1973","unstructured":"H. Herrlich and G. Strecker,Category Theory, Allyn and Bacon, Rockleigh, New Jersey, 1973."},{"key":"BF01752403_CR18","unstructured":"H.-J. Kreowski,Ein Pumpinglemma f\u00fcr Kanten-Kontextfreie Graph-Sprachen, Bericht 77\u201315, Fachbereich Informatik, Tech. U. Berlin, September 1977. (See also [4].)"},{"key":"BF01752403_CR19","doi-asserted-by":"crossref","unstructured":"M. J. O'Donnell, Computing in systems described by equations,Lecture Notes in Computer Science, 58 (1977).","DOI":"10.1007\/3-540-08531-9"},{"key":"BF01752403_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-06841-4_58","volume":"14","author":"G. Pacini","year":"1974","unstructured":"G. Pacini, C. Montangero, and F. Turini, Graph representation and computation rule for typeless recursive languages,Lecture Notes in Computer Science, 14 (1974), pp. 157\u2013169.","journal-title":"Lecture Notes in Computer Science"},{"key":"BF01752403_CR21","unstructured":"Padawitz, P.,Graph grammars and operational semantics, Bericht 78\u201333, Fachbereich Informatik, Tech. U. Berlin, October 1978. (See also [4].)"},{"key":"BF01752403_CR22","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0022-0000(75)80067-5","volume":"11","author":"V. Rajlich","year":"1975","unstructured":"V. Rajlich, Dynamics of discrete systems \u22ef,J. Computer and System Sci., 11 (1975), pp. 186\u2013202.","journal-title":"J. Computer and System Sci."},{"key":"BF01752403_CR23","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF00289616","volume":"4","author":"B. K. Rosen","year":"1975","unstructured":"B. K. Rosen, Deriving graphs from graphs by applying a production,Acta Informatica, 4 (1975), pp. 337\u2013357.","journal-title":"Acta Informatica"},{"key":"BF01752403_CR24","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00288659","volume":"6","author":"H. J. Schneider","year":"1976","unstructured":"H. J. Schneider and H. Ehrig, Grammars on partial graphs,Acta Informatica, 6 (1976), pp. 297\u2013316.","journal-title":"Acta Informatica"},{"key":"BF01752403_CR25","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1017\/S0004972700010625","volume":"17","author":"J. Staples","year":"1977","unstructured":"J. Staples, A class of replacement systems with simple optimality theory,Bull. Austral. Math. Soc., 17 (1977), p. 335\u2013350.","journal-title":"Bull. Austral. Math. Soc."},{"key":"BF01752403_CR26","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","volume":"10","author":"J. Staples","year":"1980","unstructured":"J. Staples, Computation on graph-like expressions,Theoretical Computer Sci., 10 (1980), 171\u2013185.","journal-title":"Theoretical Computer Sci."},{"key":"BF01752403_CR27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(80)90051-1","volume":"10","author":"J. Staples","year":"1980","unstructured":"J. Staples, Optimal evaluations of graph-like expressions,Theoretical Computer Sci., 10 (1980), 297\u2013316.","journal-title":"Theoretical Computer Sci."},{"key":"BF01752403_CR28","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(80)90033-X","volume":"11","author":"J. Staples","year":"1980","unstructured":"J. Staples, Speeding up subtree replacement systems,Theoretical Computer Sci., 11 (1980), 39\u201347.","journal-title":"Theoretical Computer Sci."},{"key":"BF01752403_CR29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(77)90004-2","volume":"8","author":"S. A. Vere","year":"1977","unstructured":"S. A. Vere, Relational production systems,Artificial Intelligence, 8 (1977), pp. 47\u201368.","journal-title":"Artificial Intelligence"},{"key":"BF01752403_CR30","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0022-0000(74)80048-6","volume":"9","author":"J. Vuillemin","year":"1974","unstructured":"J. Vuillemin, Correct and optimal implementations of recursion in a simple programming language,J. Computer and System Sci., 9 (1974), pp. 332\u2013354.","journal-title":"J. Computer and System Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01752403.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01752403\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01752403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T18:56:59Z","timestamp":1586285819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01752403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01752403"],"URL":"https:\/\/doi.org\/10.1007\/bf01752403","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}