{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:45:46Z","timestamp":1725518746024},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_23","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T10:48:17Z","timestamp":1221648497000},"page":"336-350","source":"Crossref","is-referenced-by-count":9,"title":["On the Recognizability of Arrow and Graph Languages"],"prefix":"10.1007","author":[{"given":"H. J. Sander","family":"Bruggink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"key":"23_CR2","first-page":"81","volume":"20","author":"M. Bouderon","year":"1987","unstructured":"Bouderon, M., Courcelle, B.: Graph expressions and graph rewritings. Mathematical Systems Theory\u00a020, 81\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"key":"23_CR3","unstructured":"Bruggink, H.J.S.: Towards a systematic method for proving termination of graph transformation systems (work-in-progress paper). In: Proc. of GT-VC 2007 (Graph Transformation for Verification and Concurrency) (2007)"},{"key":"23_CR4","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, ch. 3","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation\u2014part\u00a0I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, ch. 3, vol.\u00a01, World Scientific, Singapore (1997)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs\u00a0I. recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph grammars, monadic second-order logic and the theory of graph minors. In: Graph Structure Theory, pp. 565\u2013590. American Mathematical Society (1991)","DOI":"10.1090\/conm\/147\/01200"},{"key":"23_CR7","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, ch. 5","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 Transformation, Foundations, ch. 5, vol.\u00a01. World Scientific, Singapore (1997)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/S096012950000092X","volume":"6","author":"B. Courcelle","year":"1996","unstructured":"Courcelle, B., Lagergren, J.: Equivalent definitions of recognizability for sets of graphs of bounded tree-width. Mathematical Structures in Computer Science\u00a06(2), 141\u2013165 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2\u20133","key":"23_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2005.03.018","volume":"342","author":"B. Courcelle","year":"2005","unstructured":"Courcelle, B., Weil, P.: The recognizability of sets of graphs is a robust property. Theoretical Computer Science\u00a0342(2\u20133), 173\u2013228 (2005)","journal-title":"Theoretical Computer Science"},{"key":"23_CR10","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006)"},{"issue":"3\u20134","key":"23_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Applicable Algebra in Engineering, Communication and Computing\u00a015(3\u20134), 149\u2013171 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"19","key":"23_CR12","first-page":"420","volume":"11","author":"G. Griffing","year":"2003","unstructured":"Griffing, G.: Composition-representative subsets. Theory and Applications of Categories\u00a011(19), 420\u2013437 (2003)","journal-title":"Theory and Applications of Categories"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(93)90354-V","volume":"110","author":"A. Habel","year":"1993","unstructured":"Habel, A., Kreowski, H.-J., Lautemann, C.: A comparison of compatible, finite and inductive graph properties. Theoretical Computer Science\u00a0110(1), 145\u2013168 (1993)","journal-title":"Theoretical Computer Science"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-44898-5_24","volume-title":"Static Analysis","author":"V. Kuncak","year":"2003","unstructured":"Kuncak, V., Rinard, M.C.: Existential heap abstraction entailment is undecidable. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 418\u2013438. Springer, Heidelberg (2003)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO \u2013 Theoretical Informatics and Applications\u00a039(3) (2005)","DOI":"10.1051\/ita:2005028"},{"key":"23_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.36045\/bbms\/1103408550","volume":"1","author":"A. Potthoff","year":"1994","unstructured":"Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bulletin of the Belgian Mathematical Society\u00a01, 285\u2013298 (1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"issue":"6","key":"23_CR19","first-page":"164","volume":"15","author":"R. Rosebrugh","year":"2005","unstructured":"Rosebrugh, R., Sabadini, N., Walters, R.F.C.: Generic commutative separable algebras and cospans of graphs. Theory and applications of categories\u00a015(6), 164\u2013177 (2005)","journal-title":"Theory and applications of categories"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Rosebrugh, R., Sabadini, N., Walters, R.F.C.: Calculating colimits compositionally (2007)","DOI":"10.1007\/978-3-540-68679-8_36"},{"key":"23_CR21","first-page":"311","volume-title":"Proc. of LICS 2005","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311\u2013320. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-45005-X_34","volume-title":"Developments in Language Theory","author":"T. Urvoy","year":"2003","unstructured":"Urvoy, T.: Abstract families of graphs. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 381\u2013392. Springer, Heidelberg (2003)"},{"issue":"3","key":"23_CR23","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/S0019-9958(81)90351-X","volume":"50","author":"K.-U. Witt","year":"1981","unstructured":"Witt, K.-U.: Finite graph-acceptors and regular graph-languages. Information and Control\u00a050(3), 242\u2013258 (1981)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:37:35Z","timestamp":1606185455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}