{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:01Z","timestamp":1725486241355},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_1","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"B. Courcelle: Recursive Applicative Program Schemes, chapter 9 of Handbook of Theoretical Computer Science, Volume B, J. Van Leeuwen ed., Elsevier 1990, pp. 459\u2013492.","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","volume":"126","author":"B. Courcelle","year":"1994","unstructured":"B. Courcelle: Monadic second order graph transductions: A survey. Theoretical Computer Science, 126, (1994) 53\u201375.","journal-title":"Theoretical Computer Science"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(95)00049-3","volume":"151","author":"B. Courcelle","year":"1995","unstructured":"B. Courcelle: The Monadic Second-Order Logic of Graphs, IX: Machines and their behaviours, Theoret. Comput. Sci. 151, (1995) 125\u2013162.","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"B. Courcelle: The expression of graph properties and graph transformations in monadic second-order logic, Chapter 5 of the \u201cHandbook of graph grammars and computing by graph transformations, Vol. 1: Foundations\u201d, G. Rozenberg ed., World Scientific (New-Jersey, London), 1997, pp. 313\u2013400.","DOI":"10.1142\/9789812384720_0005"},{"key":"1_CR5","unstructured":"B. Courcelle, T. Knapik: The evaluation of first-order substitution is monadic second-order compatible, 2001, Theoret. Comput. Sci., to appear."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0168-0072(97)00048-1","volume":"92","author":"B. Courcelle","year":"1998","unstructured":"B. Courcelle, I. Walukiewicz: Monadic second-order logic, graph coverings and unfoldings of transition systems, Annals of Pure and Applied Logic, 92 (1998) 35\u201362.","journal-title":"Annals of Pure and Applied Logic"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"W. Damm: The IO-and OI hierarchies, Theoret. Comput. Sci. 20 (1982) 95\u2013208.","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"T. Knapik, D. Niwinski, P. Urzyczyn: Deciding monadic theories of hyperalgebraic trees, in Typed lambda-calculi and applications, Lec. Notes Comp. Sci., 2044 (2001) 253\u2013267.","DOI":"10.1007\/3-540-45413-6_21"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"T. Knapik, D. Niwinski, P. Urzyczyn: Higher-order pushdown trees are easy, FOSSACS 2002, this volume.","DOI":"10.1007\/3-540-45931-6_15"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"I. Walukiewicz: Monadic second-order logic on tree-like structures. Proceedings STACS\u201996, Lec. Notes Comp. Sci. 1046 (1996) 401\u2013414. (Full paper to appear).","DOI":"10.1007\/3-540-60922-9_33"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:19:29Z","timestamp":1556493569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}