{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:28Z","timestamp":1761611188147},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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\/bfb0055812","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"616-624","source":"Crossref","is-referenced-by-count":2,"title":["Facial circuits of planar graphs and context-free languages"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"Denis","family":"Lapoire","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"59_CR1","unstructured":"J.-M. Autebert. Langages alg\u00e9briques. Etudes et recherches en informatique. Masson, 1987."},{"key":"59_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12\u201375, 1990.","journal-title":"Information and Computation"},{"key":"59_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"B. Courcelle. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sc., 80:153\u2013202, 1991.","journal-title":"Theor. Comput. Sc."},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In Handbook of Graph Grammars and Computing by Graph Transformations. Vol. I: Foundations, chapter 5, pages 313\u2013400. World Scientific, 1997.","DOI":"10.1142\/9789812384720_0005"},{"key":"59_CR5","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"J. Doner. Tree acceptors and some of their applications. J. Comp. Syst. Sc., 4:406\u2013451, 1970.","journal-title":"J. Comp. Syst. Sc."},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet and L. Heyker. The string generating power of context-free hypergraph grammars. J. Comp. Syst. Sc., 43:328\u2013360, 1991.","journal-title":"J. Comp. Syst. Sc."},{"key":"59_CR7","unstructured":"D. Lapoire. Treewidth and duality for planar hypergraphs. submitted."},{"key":"59_CR8","unstructured":"D. Lapoire. Structuration des graphes planaires. PhD thesis, Universit\u00e9 Bordeaux I, Novembre 1996."},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"D. Lapoire. Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width. In Proc. STACS'98, volume 1373 of LNCS, pages 618\u2013628. Springer Verlag, 1998.","DOI":"10.1007\/BFb0028596"},{"issue":"2","key":"59_CR10","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/inco.1997.2659","volume":"138","author":"M. Latteux","year":"1997","unstructured":"M. Latteux and D. Simplot. Context-sensitive string languages and recognizable picture languages. Information and Computation, 138,2:160\u2013169, 1997.","journal-title":"Information and Computation"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"N. Robertson and P. D. Seymour. Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B, 36:49\u201364, 1984.","journal-title":"J. Comb. Theory Ser. B"},{"key":"59_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"3","author":"J.-W. Thatcher","year":"1968","unstructured":"J.-W. Thatcher and J. Wright. Generalized finite automata theory with an application to a decision problem in second-order logic. Math. Systems Theory, 3:57\u201381, 1968.","journal-title":"Math. Systems Theory"}],"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\/BFb0055812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T16:45:40Z","timestamp":1548175540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0055812","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}