{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:18Z","timestamp":1742591418467,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:47:24Z","timestamp":1330199244000},"page":"133-146","source":"Crossref","is-referenced-by-count":18,"title":["On context-free sets of graphs and their monadic second-order theory"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"J.R. BUCHI, Weak 2nd order logic and finite automata, Z. Math Logik 5(960) 66\u201392.","key":"11_CR1","DOI":"10.1002\/malq.19600060105"},{"unstructured":"B. COURCELLE, A representation of graphs by algebraic expressions and its use for graph rewriting systems, this volume.","key":"11_CR2"},{"doi-asserted-by":"crossref","unstructured":"B. COURCELLE, An axiomatic definition of context-free rewriting and its application to NLC grammars, Report 8706, Bordeaux 1 University, 1987.","key":"11_CR3","DOI":"10.1007\/BFb0035848"},{"doi-asserted-by":"crossref","unstructured":"J.DONER, Tree acceptors and applications. Jour. Comput. System Sci. 4(70) 406\u2013451","key":"11_CR4","DOI":"10.1016\/S0022-0000(70)80041-1"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1970","unstructured":"J.W. THATCHER, J.B. WRIGHT, Generalized automata theory, Maths Systems Theory 2 (1970) 57\u201381","journal-title":"Maths Systems Theory"},{"key":"11_CR6","first-page":"343","volume":"23","author":"P. Seymour","year":"1984","unstructured":"P. SEYMOUR, N. ROBERTSON, Some new results on the well quasiordering of graphs, Annals of Discrete Maths 23 (1984) 343\u2013354.","journal-title":"Annals of Discrete Maths"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:39:48Z","timestamp":1742589588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}