{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:37Z","timestamp":1725566737029},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_23","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"325-338","source":"Crossref","is-referenced-by-count":3,"title":["The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"Christian","family":"Delhomm\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","first-page":"543","volume-title":"Logic and Computational Complexity","author":"K. Barthelmann","year":"1995","unstructured":"Barthelmann, K.: When can an equational simple graph be generated by hyperedge replacement? In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 543\u2013552. Springer, Heidelberg (1995)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems\u00a037, 641\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"key":"23_CR3","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. Theoretical Computer Science\u00a0106, 61\u201386 (1992)","journal-title":"Theoretical Computer Science"},{"key":"23_CR4","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. Theoretical Computer Science\u00a025, 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"key":"23_CR5","first-page":"459","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Recursive applicative program schemes. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 459\u2013492. Elsevier, Amsterdam (1990)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","volume":"126","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: Monadic second-order graph transductions: A survey. Theoretical Computer Science\u00a0126, 53\u201375 (1994)","journal-title":"Theoretical Computer Science"},{"key":"23_CR7","series-title":"Foundations","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of graph grammars and computing by graph transformations","author":"B. Courcelle","year":"1997","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 transformations. Foundations, vol.\u00a01, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(95)00083-6","volume":"160","author":"B. Courcelle","year":"1996","unstructured":"Courcelle, B.: The monadic second-order logic of graphs X: Linear orderings. Theoretical Computer Science\u00a0160, 87\u2013143 (1996)","journal-title":"Theoretical Computer Science"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00578-9","volume":"299","author":"B. Courcelle","year":"2003","unstructured":"Courcelle, B.: The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications. Theoretical Computer Science\u00a0299, 1\u201336 (2003)","journal-title":"Theoretical Computer Science"},{"key":"23_CR10","unstructured":"Courcelle, B.: The monadic second-order logic of graphs XV: On a Conjecture by D. Seese. To appear in Journal of Applied Logic, see \n                    \n                      http:\/\/www.labri.fr\/~courcell\/ActSci.html"},{"key":"23_CR11","unstructured":"Courcelle, B., Delhomm\u00e9, C.: The modular decomposition of countable graphs (2005), see \n                    \n                      http:\/\/www.labri.fr\/~courcell\/ActSci.html"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","first-page":"145","volume-title":"Results and Trends in Theoretical Computer Science","author":"A. Ehrenfeucht","year":"1994","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: Decomposition of infinite labeled 2- structures. In: Karhum\u00e4ki, J., Rozenberg, G., Maurer, H.A. (eds.) Results and Trends in Theoretical Computer Science. LNCS, vol.\u00a0812, pp. 145\u2013158. Springer, Heidelberg (1994)"},{"key":"23_CR13","volume-title":"A framework for decomposition and transformation of graphs","author":"A. Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The theory of 2-structures. In: A framework for decomposition and transformation of graphs, World Scientific Publishing Co., River Edge (1999)"},{"key":"23_CR14","series-title":"Studies in logic","volume-title":"Theory of relations","author":"R. Fra\u00efss\u00e9","year":"1986","unstructured":"Fra\u00efss\u00e9, R.: Theory of relations, 2nd edn. Studies in logic, vol.\u00a0118. North-Holland, Amsterdam (1986) (Second edition, Elsevier, 2000)","edition":"2"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kelly, D.: Comparability graphs. In: Rival, I. (ed.) Graphs and order, pp. 3\u201340. D. Reidel Pub. Co. (1985)","DOI":"10.1007\/978-94-009-5315-4_1"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"23_CR17","first-page":"257","volume":"19","author":"R. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R., Radermacher, R.: Substitution decomposition of discrete structures and connections with combinatorial optimization. Annals Discrete Maths\u00a019, 257\u2013356 (1984)","journal-title":"Annals Discrete Maths"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:14Z","timestamp":1619506454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11538363_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}