{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T18:53:23Z","timestamp":1672599203020},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf02088013","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T11:25:48Z","timestamp":1124018748000},"page":"187-221","source":"Crossref","is-referenced-by-count":60,"title":["The monadic second-order logic of graphs, II: Infinite graphs of bounded width"],"prefix":"10.1007","volume":"21","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02088013_CR1","doi-asserted-by":"crossref","unstructured":"Bauderon, M., On systems of equations defining infinite graphs,Proceedings of the Colloquium on Graph Theoretic Concepts in Computer Science (WG'88), June 1988, Amsterdam, Springer-Verlag, Berlin, to appear.","DOI":"10.1007\/3-540-50728-0_35"},{"key":"BF02088013_CR2","unstructured":"Bauderon, M., Infinite hypergraphs, in preparation."},{"key":"BF02088013_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Bauderon, M., and Courcelle, B., Graph expressions and graph rewritings,Math. Systems Theory,20 (1987), 83\u2013127.","journal-title":"Math. Systems Theory"},{"key":"BF02088013_CR4","doi-asserted-by":"crossref","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,Theoret. Comput. Sci.,25 (1983), 95\u2013169.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02088013_CR5","first-page":"1","volume":"42","author":"B. Courcelle","year":"1986","unstructured":"Courcelle, B., Equivalences and transformations of regular systems.Applications to recursive program schemes, Theoret. Comput. Sci.,42 (1986), 1\u2013122.","journal-title":"Applications to recursive program schemes, Theoret. Comput. Sci."},{"key":"BF02088013_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B., An axiomatic definition of context-free rewriting, and its application to NLC graph grammars,Theoret. Comput. Sci.,55 (1987), 141\u2013181.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02088013_CR7","first-page":"112","volume-title":"Lecture Notes in Computer Science, Vol. 291","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B., A representation of graphs by algebraic expressions and its use for graph rewriting systems,Proceedings of the Third Internal Workshop on Graph Grammars, Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987, pp. 112\u2013132."},{"key":"BF02088013_CR8","first-page":"133","volume-title":"Lecture Notes in Computer Science, Vol. 291","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B., On context-free sets of graphs and their monadic 2nd-order theory,Proceedings of the Third Internal Workshop on Graph Grammars, Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987, pp. 133\u2013146."},{"key":"BF02088013_CR9","first-page":"83","volume-title":"Programming of Future Generation Computers, II","author":"B. Courcelle","year":"1988","unstructured":"Courcelle, B., On using context-free graph grammars for analyzing recursive definitions, inProgramming of Future Generation Computers, II (K. Fuchi, L. Kott, eds.), Elsevier, Amsterdam, 1988, pp. 83\u2013122."},{"key":"BF02088013_CR10","unstructured":"Courcelle, B., The monadic second-order logic of graphs, I: Recognizable sets of finite graphs, Report I-8837, submitted."},{"key":"BF02088013_CR11","unstructured":"Courcelle, B., The monadic second-order logic of graphs, III: Tree-width, forbidden minors and complexity issues, Report I-8852, submitted."},{"key":"BF02088013_CR12","unstructured":"Courcelle, B., The monadic second-order logic of graphs, IV: Every equational graph is definable, Report I-8830, submitted."},{"key":"BF02088013_CR13","unstructured":"Courcelle, B., Recursive applicative program schemes, inHandbook of Theoretical Computer Science, J. Van Leeuwen, ed., Elsevier, Amsterdam, to appear."},{"key":"BF02088013_CR14","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J., Tree acceptors and some of their applications,J. Comput. System Sci.,4 (1970), 406\u2013451.","journal-title":"J. Comput. System Sci."},{"key":"BF02088013_CR15","first-page":"80","volume-title":"Current Trends in Programming Methodology","author":"J. Goguen","year":"1978","unstructured":"Goguen, J., Thatcher, J., and Wagner, E., An initial algebra approach to the specification, correctness and implementation of abstract data types, inCurrent Trends in Programming Methodology, R. Yeh, ed., Prentice-Hall, Englewood Cliffs, NJ, 1978, pp. 80\u2013149."},{"key":"BF02088013_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"Goguen, J., Thatcher, J., Wagner, E., and Wright, J., Initial algebra semantics and continuous algebras,Assoc. Comput. Mach.,24 (1977), 68\u201395.","journal-title":"Assoc. Comput. Mach."},{"key":"BF02088013_CR17","volume-title":"Algebraic Semantics, Lecture Notes in Computer Science, Vol. 99","author":"I. Guessarian","year":"1981","unstructured":"Guessarian, I.,Algebraic Semantics, Lecture Notes in Computer Science, Vol. 99, Springer-Verlag, Berlin, 1981."},{"key":"BF02088013_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BFb0099486","volume-title":"Computation and Proof Theory","author":"Y. Gurevich","year":"1984","unstructured":"Gurevich, Y., Toward logic tailored for computational complexity, inComputation and Proof Theory, M. Richter, ed., Lecture Notes in Mathematics, Vol. 1104, Springer-Verlag, Berlin, 1984, pp. 175\u2013216."},{"key":"BF02088013_CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D Muller","year":"1985","unstructured":"Muller, D, and Schupp, P., The theory of ends, pushdown automata and second-order logic,Theoret. Comput. Sci.,37 (1985), 51\u201375.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02088013_CR20","unstructured":"Nivat, M., Genealogies, unpublished report, University of Paris 7, 1987."},{"key":"BF02088013_CR21","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M., Decidability of 2nd-order theories and automata on infinite trees,Trans. Amer. Math. Soc.,141 (1969), 1\u201335.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF02088013_CR22","doi-asserted-by":"crossref","unstructured":"Rabin, M.,Automata on Infinite objects and Church's Problem, Regional Conference Series in Mathematics, Vol. 13, A.M.S., Providence, RI, 1972.","DOI":"10.1090\/cbms\/013"},{"key":"BF02088013_CR23","doi-asserted-by":"crossref","unstructured":"Seese, D., The structure of the models of decidable monadic theories,J. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(91)90054-P"},{"key":"BF02088013_CR24","unstructured":"Seese, D., Ordered tree-representations of infinite graphs, Preprint, Akademie der DDR, Berlin, East Germany, 1987."},{"key":"BF02088013_CR25","first-page":"569","volume":"70","author":"B. Trahtenbrot","year":"1950","unstructured":"Trahtenbrot, B., Impossibility of an algorithm for the decision problem on finite classes,Dokl. Akad. Nauk. SSSR,70 (1950), 569\u2013572.","journal-title":"Dokl. Akad. Nauk. SSSR"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02088013.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02088013\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02088013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:49:00Z","timestamp":1586393340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02088013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF02088013"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf02088013","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":["Computational Theory and Mathematics","General Mathematics","Theoretical Computer Science","Computational Theory and Mathematics","Theoretical Computer Science"],"published":{"date-parts":[[1988,12]]}}}