{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:25Z","timestamp":1761611065446},"reference-count":48,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0304-3975(95)00145-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"1-54","source":"Crossref","is-referenced-by-count":24,"title":["Basic notions of universal algebra for language theory and graph grammars"],"prefix":"10.1016","volume":"163","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00145-X_BIB1","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reduction","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00145-X_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnbor","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(95)00145-X_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0022-0000(76)80032-3","article-title":"Un th\u00e9or\u00e8me de duplication pour les for\u00eats alg\u00e9briques","volume":"13","author":"Arnold","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB4","series-title":"Tree Automata and Languages","first-page":"159","article-title":"Fixed-point characterization of weak monadic logic definable sets of trees","author":"Arnold","year":"1992"},{"key":"10.1016\/0304-3975(95)00145-X_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph rewriting and graph expressions","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00145-X_BIB6","first-page":"433","article-title":"On the structure of abstract algebras","volume":"29","author":"Birkhoff","year":"1935"},{"key":"10.1016\/0304-3975(95)00145-X_BIB7","series-title":"Alg\u00e8bre","author":"Bourbaki","year":"1970"},{"key":"10.1016\/0304-3975(95)00145-X_BIB8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1006\/inco.1994.1010","article-title":"On the existence of minimum asynchronous automata and on the equivalence problem for unambigous regular trace languages","volume":"108","author":"Bruschi","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1052","article-title":"Asynchronous mappings and asynchronous cellular automata","volume":"106","author":"Cori","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","article-title":"Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars","volume":"42","author":"Courcelle","year":"1986","journal-title":"Theoret. Comput Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","article-title":"An axiomatic definition of context-free rewriting and its application to NLC graph grammars","volume":"55","author":"Courcelle","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB12","first-page":"93","article-title":"On recognizable sets and tree-automata","volume":"Vol. 1","author":"Courcelle","year":"1989"},{"key":"10.1016\/0304-3975(95)00145-X_BIB13","first-page":"193","article-title":"Graph rewriting: an algebraic and logic approach","volume":"Vol. B","author":"Courcelle","year":"1990"},{"key":"10.1016\/0304-3975(95)00145-X_BIB14","first-page":"460","article-title":"Recursive applicative program schemes","volume":"Vol. B","author":"Courcelle","year":"1990"},{"key":"10.1016\/0304-3975(95)00145-X_BIB15","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs I, Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","article-title":"The monadic second-order logic of graphs V, On closing the gap between definability and recognizability","volume":"80","author":"Courcelle","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90148-9","article-title":"The monadic second-order logic of graphs VII, Graphs as relational structures","volume":"101","author":"Courcelle","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB18","series-title":"Tree Automata and Languages","first-page":"141","article-title":"Recognizable sets of unrooted trees","author":"Courcelle","year":"1992"},{"key":"10.1016\/0304-3975(95)00145-X_BIB19","series-title":"Graph structure theory","first-page":"565","article-title":"Graph grammars, monadic second-order logic, and the theory of graphs minors","volume":"147","author":"Courcelle","year":"1993"},{"key":"10.1016\/0304-3975(95)00145-X_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129500000359","article-title":"Recognizable sets of graphs: equivalent definitions and closure properties","volume":"4","author":"Courcelle","year":"1994","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1006\/inco.1995.1020","article-title":"Structural properties of sets of hypergraphs generated by vertex replacement","volume":"116","author":"Courcelle","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB22","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraph grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","article-title":"Monadic second-order evaluation of tree-decomposable graphs","volume":"109","author":"Courcelle","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","article-title":"The IO and OI hierarchies","volume":"20","author":"Damm","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB25","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(95)00145-X_BIB26","series-title":"Fundamentals of Algebraic Specifications 1: Equations and Initial Semantics","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(95)00145-X_BIB27","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(95)00145-X_BIB28_1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB28_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","article-title":"IO and OI","volume":"16","author":"Engelfriet","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB29","series-title":"Tree-automata","author":"Gecseg","year":"1984"},{"key":"10.1016\/0304-3975(95)00145-X_BIB30","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to ALGOL","volume":"9","author":"Ginsburg","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00145-X_BIB31","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00145-X_BIB32","article-title":"Algebraic semantics","volume":"Vol. 99","author":"Guessarian","year":"1981"},{"key":"10.1016\/0304-3975(95)00145-X_BIB33","article-title":"Hyperedge replacement: grammars and languages","volume":"Vol. 643","author":"Habel","year":"1992"},{"key":"10.1016\/0304-3975(95)00145-X_BIB34","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/0304-3975(95)00145-X_BIB35","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","article-title":"Fixed-point theorems and semantics: a folk tale","volume":"14","author":"Lassez","year":"1982","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/0304-3975(95)00145-X_BIB36","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0890-5401(90)90033-E","article-title":"Tools for proving inductive equalities, relative completeness and \u03c9-completeness","volume":"84","author":"Lazrek","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB37","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(81)90005-0","article-title":"On generalized language equations","volume":"14","author":"Leiss","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00145-X_BIB38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","article-title":"Algebraic automata and context-free sets","volume":"11","author":"Mezei","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00145-X_BIB39","series-title":"Proc. 3rd Symp. on Logic In Computer Science","first-page":"402","article-title":"Fixed points vs. infinite generation","author":"Niwinski","year":"1988"},{"key":"10.1016\/0304-3975(95)00145-X_BIB40","first-page":"173","article-title":"Easy multiplications II: extensions of rational monoids","volume":"74","author":"Pelletier","year":"1987","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB41","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1112\/jlms\/s2-6.4.663","article-title":"Commutative regular equations and Parikh's theorem","volume":"6","author":"Pilling","year":"1973","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0304-3975(95)00145-X_BIB42","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0890-5401(87)90020-4","article-title":"Easy multiplications I: the realm of Kleene's Theorem","volume":"74","author":"Sakarovich","year":"1987","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00145-X_BIB43","first-page":"360","article-title":"Some algebraic aspects of recognizability and rationality","volume":"Vol. 117","author":"Steinby","year":"1981"},{"key":"10.1016\/0304-3975(95)00145-X_BIB44","article-title":"D\u00e9cidabilit\u00e9 de l'\u03c9-compl\u00e9tude des sp\u00e9cifications alg\u00e9briques par des axiomes \u00e9galitaires clos","author":"Tajine","year":"1992"},{"key":"10.1016\/0304-3975(95)00145-X_BIB45","series-title":"Universal Algebra for Computer Scientists","author":"Wechler","year":"1992"},{"key":"10.1016\/0304-3975(95)00145-X_BIB46","first-page":"675","article-title":"Algebraic specifications","volume":"Vol. B","author":"Wirsing","year":"1990"},{"key":"10.1016\/0304-3975(95)00145-X_BIB47","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","article-title":"Notes on finite asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"RAIRO Inform. Th\u00e9ortique Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500145X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500145X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:24:34Z","timestamp":1556508274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500145X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["030439759500145X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00145-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}