{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:27Z","timestamp":1759638687918},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_24","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"243-255","source":"Crossref","is-referenced-by-count":4,"title":["On the Use of Guards for Logics with Data"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Ley","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Puppis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-15205-4_12","volume-title":"Computer Science Logic","author":"M. Benedikt","year":"2010","unstructured":"Benedikt, M., Ley, C., Puppis, G.: Automata vs. Logics on data words. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 110\u2013124. Springer, Heidelberg (2010)"},{"key":"24_CR2","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW). CEUR Workshop Proceedings. CEUR-WS.org, vol. 619 (2010)"},{"key":"24_CR3","unstructured":"Boja\u0144czyk, M.: Data monoids. In: Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a09, pp. 105\u2013116. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"24_CR4","first-page":"7","volume-title":"Proceedings of the 21th IEEE Symposium on Logic in Computer Science LICS","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science LICS, pp. 7\u201316. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"1-6","key":"24_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"R.J. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, R.J.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06(1-6), 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-78127-1_21","volume-title":"Pillars of Computer Science","author":"M. Kaminski","year":"2008","unstructured":"Kaminski, M., Tan, T.: Tree automata over infinite alphabets. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol.\u00a04800, pp. 386\u2013423. Springer, Heidelberg (2008)"},{"key":"24_CR9","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. M.I.T. Research Monograph. Elsevier MIT Press (1971)"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"key":"24_CR11","unstructured":"Pin, J.E.: Mathematical foundations of automata theory (2010), \n                    \n                      http:\/\/www.liafa.jussieu.fr\/~jep\/MPRI\/MPRI.html"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","volume":"73","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for XML - a survey. Journal of Computer and System Sciences\u00a073(3), 289\u2013315 (2007)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control\u00a08(2), 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"24_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Basel (1994)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:40:23Z","timestamp":1620042023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}