{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:57:36Z","timestamp":1768276656908,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540522928","type":"print"},{"value":"9783540469506","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52292-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:30:39Z","timestamp":1330205439000},"page":"107-120","source":"Crossref","is-referenced-by-count":3,"title":["Filtering hyperedge-replacement languages through compatible properties"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-18771-5_50","volume":"291","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle: On Context-Free Sets of Graphs and Their Monadic Second-Order Theory, Lect. Not. Comp. Sci. 291, 133\u2013146, 1987","journal-title":"Lect. Not. Comp. Sci."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"B.Courcelle: The Monadic Second-Order Logic of Graphs I: Recognizable Sets of Finite Graphs, revised version of \u201dRecognizability and Second Order Definability for Sets of Finite Graphs\u201d (Research Report 8634), Report 8837, Bordeaux I University, 1988","DOI":"10.1007\/3-540-50728-0_34"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-50728-0_33","volume":"344","author":"A. Habel","year":"1989","unstructured":"A. Habel: Graph-Theoretic Properties Compatible with Graph Derivations, Proc. Graph-Theoretic Concepts in Computer Science 1988 (WG'88), Lect. Not. Comp. Sci. 344, 11\u201329, 1989","journal-title":"Lect. Not. Comp. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Proc. STACS'87, Lect. Not. Comp. Sci. 247, 207\u2013219, 1987","journal-title":"Lect. Not. Comp. Sci."},{"key":"8_CR5","first-page":"55","volume":"33","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages, to appear in Acta Informatica, short version with the title \u201dCompatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages\u201d in: Bull. EATCS 33, 55\u201362, 1987","journal-title":"Bull. EATCS"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-50939-9_138","volume":"351","author":"A. Habel","year":"1989","unstructured":"A. Habel, H.-J. Kreowski, W. Vogler: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars, Proc. Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), Lect. Not. Comp. Sci. 351, 275\u2013289, 1989","journal-title":"Lect. Not. Comp. Sci."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-19488-6_129","volume":"317","author":"T. Lengauer","year":"1988","unstructured":"T. Lengauer, E. Wanke: Efficient Analysis of Graph Properties on Context-Free Graph Languages, Proc. ICALP'88, Lect. Not. Comp. Sci. 317, 379\u2013393, 1988","journal-title":"Lect. Not. Comp. Sci."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"J. Mezei, J. B. Wright: Algebraic Automata and Context-Free Sets, Information and Control 11, 3\u201329, 1967","journal-title":"Information and Control"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages, Acta Informatica 23, 289\u2013309, 1986","journal-title":"Acta Informatica"},{"key":"8_CR10","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa: Formal Languages, Academic Press, New York, 1973"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52292-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:01:00Z","timestamp":1687284060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52292-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522928","9783540469506"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-52292-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}