{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T21:30:43Z","timestamp":1675114243616},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"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":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90222-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"177-214","source":"Crossref","is-referenced-by-count":11,"title":["Infinite hypergraphs I. Basic properties"],"prefix":"10.1016","volume":"82","author":[{"given":"Michael","family":"Bauderon","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90222-N_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","article-title":"Least fixed points of a functor","volume":"19","author":"Adamek","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90222-N_BIB2","series-title":"Proc. WG'88","first-page":"54","article-title":"On some properties of infinite graphs","volume":"344","author":"Bauderon","year":"1989"},{"key":"10.1016\/0304-3975(91)90222-N_BIB3","unstructured":"M. Bauderon, Infinite hypergraphs, II. Systems of recursive equations, Theoret Comput. Sci., to appear."},{"key":"10.1016\/0304-3975(91)90222-N_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90222-N_BIB5","series-title":"Research report 441","article-title":"Pattern graphs","author":"Caucal","year":"1988"},{"key":"10.1016\/0304-3975(91)90222-N_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(89)90161-8","article-title":"Categories of embedding","volume":"68","author":"Coquand","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90222-N_BIB7","series-title":"Category Theory and Computer Science","first-page":"40","article-title":"An equational presentation of higher-order logic","volume":"283","author":"Coquand","year":"1987"},{"issue":"4","key":"10.1016\/0304-3975(91)90222-N_BIB8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1978120403191","article-title":"Frontiers of infinite trees","volume":"12","author":"Courcelle","year":"1978","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(91)90222-N_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90222-N_BIB10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0168-0072(90)90027-Y","article-title":"The monadic 2nd order logic of graphs IV: definability properties of equational graphs","author":"Courcelle","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(91)90222-N_BIB11","unstructured":"B. Courcelle, The monadic 2nd order logic of graphs III: tree-decomposition, forbidden minors and complexity issues, to appear in RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(91)90222-N_BIB12","first-page":"193","article-title":"Graph rewriting: an algebraic and logic approach","volume":"Vol. B","author":"Courcelle","year":"1990"},{"issue":"3","key":"10.1016\/0304-3975(91)90222-N_BIB13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1051\/ita\/1986200302511","article-title":"Continuous monoids and yields of infinite trees","volume":"20","author":"Dauchet","year":"1986","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(91)90222-N_BIB14","first-page":"1","article-title":"Introduction to the Algebraic Theory of Graphs","volume":"73","author":"Ehrig","year":"1977"},{"key":"10.1016\/0304-3975(91)90222-N_BIB15","series-title":"EATCS Monographs in Theoretical Computer Science","article-title":"Fundamentals of algebraic specifications","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(91)90222-N_BIB16_1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(84)90134-8","article-title":"Some fundamental algebraic tools for the semantics of computation","volume":"31","author":"Goguen","year":"1984","journal-title":"Theoret. Comput. Sci. Part 1"},{"key":"10.1016\/0304-3975(91)90222-N_BIB16_2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(84)90036-7","article-title":"Some fundamental algebraic tools for the semantics of computation","volume":"31","author":"Goguen","year":"1984","journal-title":"Theoret. Comput. Sci. Part 2"},{"key":"10.1016\/0304-3975(91)90222-N_BIB17","article-title":"Hyperedge replacement grammars and language","author":"Habel","year":"1989","journal-title":"Thesis"},{"key":"10.1016\/0304-3975(91)90222-N_BIB18_1","first-page":"207","article-title":"Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement","volume":"247","author":"Habel","year":"1987"},{"key":"10.1016\/0304-3975(91)90222-N_BIB18_2","series-title":"May we introduce to you: hyperedge replacement","first-page":"15","volume":"291","year":"1987"},{"key":"10.1016\/0304-3975(91)90222-N_BIB19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1051\/ita\/1980140201311","article-title":"An algorithm for the solution of fixed point equations for infinite words","volume":"14","author":"Heilbrunner","year":"1980","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(91)90222-N_BIB20","series-title":"MFCS 1979","first-page":"326","article-title":"Fully effective solutions of recursive domain equations","volume":"74","author":"Kanda","year":"1979"},{"key":"10.1016\/0304-3975(91)90222-N_BIB21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","article-title":"A fixpoint theorem for complete category","volume":"103","author":"Lambek","year":"1968","journal-title":"Math. Z."},{"key":"10.1016\/0304-3975(91)90222-N_BIB22","first-page":"200","article-title":"Fixpoint revisited, Logik at Botik","volume":"363","author":"Lambek","year":"1989"},{"key":"10.1016\/0304-3975(91)90222-N_BIB23","first-page":"122","article-title":"Categories for fixpoint semantics","author":"Lehmann","year":"1976","journal-title":"17th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90222-N_BIB24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","article-title":"Algebraic specification of data types","volume":"14","author":"Lehmann","year":"1981","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90222-N_BIB25","series-title":"Trends, Techniques and Problems in Theoretical Computer Science","first-page":"138","article-title":"Models for multicellular development: characterization, inference and complexity of L-systems","volume":"281","author":"Lindenmayer","year":"1987"},{"key":"10.1016\/0304-3975(91)90222-N_BIB26","series-title":"Algebraic Theories","author":"Manes","year":"1976"},{"key":"10.1016\/0304-3975(91)90222-N_BIB27","series-title":"The AKM Series in Theoretical Computer Science","article-title":"Algebraic Approach to Program Semantics","author":"Manes","year":"1986"},{"key":"10.1016\/0304-3975(91)90222-N_BIB28","series-title":"Category for the Working Mathematician","author":"McLane","year":"1971"},{"key":"10.1016\/0304-3975(91)90222-N_BIB29","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata and second-order logic","volume":"37","author":"Muller","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90222-N_BIB30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Powerdomains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(91)90222-N_BIB31","series-title":"Proc. 7th ICALP","first-page":"609","article-title":"Computability in categories","volume":"85","author":"Smyth","year":"1980"},{"issue":"4","key":"10.1016\/0304-3975(91)90222-N_BIB32","doi-asserted-by":"crossref","DOI":"10.1137\/0211062","article-title":"The category theoretic solution to recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0304-3975(91)90222-N_BIB33","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1051\/ita\/1986200403711","article-title":"On frontier of regular trees","volume":"20","author":"Thomas","year":"1986","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(91)90222-N_BIB34","series-title":"EATCS Monographs in Theoretical Computer Science","article-title":"Computability","author":"Weihrauch","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190222N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190222N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:54Z","timestamp":1555127634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190222N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["030439759190222N"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90222-n","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}