{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:27Z","timestamp":1725468507993},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055804","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"543-552","source":"Crossref","is-referenced-by-count":12,"title":["When can an equational simple graph be generated by hyperedge replacement?"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Barthelmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","volume":"19","author":"J. Ad\u00e1mek","year":"1979","unstructured":"Ad\u00e1mek, J., Koubek, V.: Least Fixed Point of a Functor. J. Comput. System Sci. 19 (1979) 163\u2013178","journal-title":"J. Comput. System Sci."},{"unstructured":"Barthelmann, K.: How to Construct a Hyperedge Replacement System for a Context-Free Set of Hypergraphs. Tech. Rep. 7, Universit\u00e4t Mainz, Institut f\u00fcr Informatik (1996). Submitted for publication","key":"51_CR2"},{"unstructured":"Barthelmann, K.: On Equational Simple Graphs. Tech. Rep. 9, Universit\u00e4t Mainz, Institut f\u00fcr Informatik (1997). Submitted for publication","key":"51_CR3"},{"doi-asserted-by":"crossref","unstructured":"Barthelmann, K.: When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?. Tech. Rep. 2, Universit\u00e4t Mainz, Institut f\u00fcr Informatik (1998)","key":"51_CR4","DOI":"10.1007\/BFb0055804"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(91)90222-N","volume":"82","author":"M. Bauderon","year":"1991","unstructured":"Bauderon, M.: Infinite hypergraphs I. Basic properties. Theoret. Comput. Sci. 82 (1991) 177\u2013214","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(92)90011-4","volume":"103","author":"M. Bauderon","year":"1992","unstructured":"Bauderon, M.: Infinite hypergraphs II. Systems of recursive equations. Theoret. Comput. Sci. 103 (1992) 165\u2013190","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph Expressions and Graph Rewritings. Math. Systems Theory 20 (1987) 83\u2013127","journal-title":"Math. Systems Theory"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. Theoret. Comput. Sci. 106 (1992) 61\u201386","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Caucal, D.: On Infinite Transition Graphs Having a Decidable Monadic Theory. In: auf der Heide, F. M., Monien, B. (eds.): Automata, Languages and Programming (ICALP '96), Lecture Notes in Computer Science, Vol. 1099. Springer (1996) 194\u2013205","key":"51_CR9","DOI":"10.1007\/3-540-61440-0_128"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoret. Comput. Sci. 25 (1983) 95\u2013169","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width. Math. Systems Theory 21 (1989) 187\u2013221","journal-title":"Math. Systems Theory"},{"doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph Rewriting: An Algebraic and Logic Approach. In: van Leeuwen [23], Ch. 5, 193\u2013242","key":"51_CR12","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0168-0072(90)90027-Y","volume":"49","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs IV: Definability properties of equational graphs. Ann. Pure Appl. Logic 49 (1990) 193\u2013255","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"51_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues. RAIRO Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications 26, 3 (1992) 257\u2013286","journal-title":"RAIRO Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90148-9","volume":"101","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs VII: Graphs as relational structures. Theoret. Comput. Sci. 101 (1992) 3\u201333","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1006\/inco.1995.1020","volume":"116","author":"B. Courcelle","year":"1995","unstructured":"Courcelle, B.: Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement. Inform. and Comput. 116 (1995) 275\u2013293","journal-title":"Inform. and Comput."},{"doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. In: Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1, Foundations. World Scientific (1997) Ch. 5, 313\u2013400","key":"51_CR17","DOI":"10.1142\/9789812384720_0005"},{"key":"51_CR18","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-Rewriting Hypergraph Grammars. J. Comput. System Sci. 46 (1993) 218\u2013270","journal-title":"J. Comput. System Sci."},{"key":"51_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109 (1993) 49\u201382","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Engelfriet, J.: Context-Free Graph Grammars. In: Rozenberg and Salomaa [22], Ch. 3, 125\u2013213","key":"51_CR20","DOI":"10.1007\/978-3-642-59126-6_3"},{"key":"51_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. E. Muller","year":"1985","unstructured":"Muller, D. E., Schupp, P. E.: The theory of ends, pushdown automata, and second-order logic. Theoret. Comput. Sci. 37 (1985) 51\u201375","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 3, Beyond Words. Springer (1997)","key":"51_CR22","DOI":"10.1007\/978-3-642-59126-6"},{"unstructured":"van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics. Elsevier (1990)","key":"51_CR23"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:44:34Z","timestamp":1555771474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0055804","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}