{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:05:50Z","timestamp":1737435950209,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432838"},{"type":"electronic","value":"9783540458418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45841-7_46","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:11:17Z","timestamp":1186906277000},"page":"559-570","source":"Crossref","is-referenced-by-count":5,"title":["Ground Tree Rewriting Graphs of Bounded Tree Width"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"46_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/BFb0055804","volume-title":"When can an equational simple graph be generated by hyperedge replacement?","author":"K. Barthelmann","year":"1998","unstructured":"Klaus Barthelmann. When can an equational simple graph be generated by hyperedge replacement? In Proceedings of MFCS\u2019 98, volume 1450 of LNCS, pages 543\u2013552. Springer-Verlag, 1998."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Achim Blumensath and Erich Gr\u00e4del. Automatic structures. In Proceedings of LICS\u2019 00, pages 51\u201362. IEEE Computer Society Press, 2000.","DOI":"10.1109\/LICS.2000.855755"},{"key":"46_CR3","unstructured":"Achim Blumensath. Prefix-recognizable graphs and monadic second order logic. Technical Report AIB-2001-06, RWTH Aachen, May 2001."},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W. S. Brainerd","year":"1969","unstructured":"Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217\u2013231, 1969.","journal-title":"Information and Control"},{"issue":"1","key":"46_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61\u201386, 1992.","journal-title":"Theoretical Computer Science"},{"key":"46_CR6","series-title":"Lect Notes Comput Sci","volume-title":"On infinite transition graphs having a decidable monadic theory","author":"D. Caucal","year":"1996","unstructured":"Didier Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings of ICALP\u2019 96, volume 1099 of LNCS. Springer-Verlag, 1996."},{"key":"46_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-53414-8_34","volume-title":"Aspects and Prospects of Theoretical Computer Science","author":"J.L. Coquid\u00e9","year":"1990","unstructured":"J.L. Coquid\u00e9 and R. Gilleron. Proofs and reachability problem for ground rewrite systems. In Aspects and Prospects of Theoretical Computer Science, volume 464 of LNCS, pages 120\u2013129. Springer, 1990."},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77\u2013114, 2000.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M. Dauchet","year":"1990","unstructured":"Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 88(2):187\u2013201, October 1990.","journal-title":"Information and Computation"},{"key":"46_CR10","unstructured":"Reinhard Diestel. Graph Theory. Springer, second edition, 2000."},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Max Dauchet and Sophie Tison. The theory of ground rewrite systems is decidable. In Proceedings of LICS\u2019 90, pages 242\u2013248. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"46_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-40064-8_19","volume-title":"The tree-width of clique-width bounded graphs without Kn,n.","author":"F. Gurski","year":"2000","unstructured":"Frank Gurski and Egon Wanke. The tree-width of clique-width bounded graphs without Kn,n. In Proceedings of WG 2000, volume 1928 of LNCS, pages 196\u2013205. Springer-Verlag, 2000."},{"issue":"1\u20132","key":"46_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Richard Mayr. Process rewrite systems. Information and Computation, 156(1\u20132):264\u2013286, 2000.","journal-title":"Information and Computation"},{"key":"46_CR14","series-title":"Lect Notes Comput Sci","first-page":"252","volume-title":"On rational graphs","author":"C. Morvan","year":"1999","unstructured":"Christophe Morvan. On rational graphs. In Proceedings of FoSSaCS\u2019 99, volume 1784 of LNCS, pages 252\u2013266. Springer, 1999."},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. E. Muller","year":"1985","unstructured":"David E. Muller and Paul E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51\u201375, 1985.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45841-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:55:31Z","timestamp":1737363331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45841-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432838","9783540458418"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45841-7_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}