{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:36Z","timestamp":1725456396245},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645702"},{"type":"electronic","value":"9783540693536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028029","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:02:06Z","timestamp":1132642926000},"page":"424-440","source":"Crossref","is-referenced-by-count":0,"title":["A hierarchical approach to monadic second-order logic over graphs"],"prefix":"10.1007","author":[{"given":"Ina","family":"Schiering","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, D. Seese, Easy problems for tree-decomposible graphs, J. of Algorithms 12 (1991), 308\u2013340.","journal-title":"J. of Algorithms"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"B. Courcelle, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Math. Systems Theory 21 (1989), 187\u2013221.","journal-title":"Math. Systems Theory"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/inco.1996.0018","volume":"125","author":"D. Giammarresi","year":"1996","unstructured":"D. Giammarresi, A. Restivo, S. Seibert, W. Thomas, Monadic second-order logic over rectangular pictures and recognizability by tiling systems, Information and Computation 125 (1996), 32\u201345.","journal-title":"Information and Computation"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","volume":"98","author":"R. Fagin","year":"1975","unstructured":"R. Fagin, Monadic generalized spectra. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, 98 (1975), 89\u201396.","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.36045\/bbms\/1103408550","volume":"1","author":"A. Potthoff","year":"1994","unstructured":"A. Potthoff, S. Seibert, W. Thomas, Nondeterminism versus determinism of finite automata over acyclic directed graphs, Bull. Belg. Math. Soc. Simon Stevin 1 (1994), 285\u2013298.","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"39","author":"N. Robertson","year":"1983","unstructured":"N. Robertson, P.D. Seymour, Graph minors I. Excluding a forest, J. of Combinatorial Theory, Series B 39 (1983), 39\u201361.","journal-title":"J. of Combinatorial Theory, Series B"},{"unstructured":"I. Schiering, Doctoral Dissertation, University of Kiel (in preparation).","key":"26_CR7"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0168-0072(91)90054-P","volume":"53","author":"D. Seese","year":"1991","unstructured":"D. Seese, The structure of the models of decidable monadic theories of graphs, Annals of Pure and Applied Logic 53 (1991), 169\u2013195.","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"D. Seese, Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees, in: Tree Automata and Languages (M. Nivat, A. Podelski Eds.), Elsevier Science Publishers, 1992, pp. 83\u2013114.","key":"26_CR9"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-54233-7_154","volume-title":"Automata, Languages, and Programming","author":"W. Thomas","year":"1991","unstructured":"W. Thomas, On logics tilings, and automata, in Automata, Languages, and Programming (J. Leach et al., Eds.), Lecture Notes in Computer Science 510, Springer-Verlag, Berlin 1991, pp. 441\u2013453."},{"doi-asserted-by":"crossref","unstructured":"W. Thomas, Elements of an automata theory over partial orders, in: Partial Order Methods in Verification (D.A. Peled et al., eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 29, Amer. Math. Soc. 1997, pp. 25\u201340.","key":"26_CR11","DOI":"10.1090\/dimacs\/029\/02"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:51:26Z","timestamp":1586573486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645702","9783540693536"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0028029","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}