{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:53Z","timestamp":1759638233998,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_12","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:14:02Z","timestamp":1314278042000},"page":"171-186","source":"Crossref","is-referenced-by-count":13,"title":["An Automaton over Data Words That Captures EMSO Logic"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R. Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. Journal of the ACM\u00a056(3), 1\u201343 (2009)","journal-title":"Journal of the ACM"},{"issue":"4-5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.tcs.2009.10.009","volume":"411","author":"H. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theoretical Computer Science\u00a0411(4-5), 702\u2013715 (2010)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Lasota, S.: An extension of data automata that captures XPath. In: LICS 2010, pp. 243\u2013252. IEEE Computer Society, Los Alamitos (2010)","DOI":"10.1109\/LICS.2010.33"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS 2006, pp. 7\u201316. IEEE Computer Society, Los Alamitos (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-642-13182-0_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"Benedikt Bollig","year":"2010","unstructured":"Bollig, B., H\u00e9lou\u00ebt, L.: Realizability of dynamic MSC languages. In: Ablayev, F., Mayr, E. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 48\u201359. Springer, Heidelberg (2010)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Bollig, B., Kuske, D.: An optimal construction of Hanf sentences, arXiv:1105.5487 (2011)","DOI":"10.1016\/j.jal.2012.01.002"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2006.01.014","volume":"358","author":"B. Bollig","year":"2006","unstructured":"Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science\u00a0358(2), 150\u2013172 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","volume":"84","author":"P. Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Information Processing Letters\u00a084(2), 75\u201385 (2002)","journal-title":"Information Processing Letters"},{"issue":"2","key":"12_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"Daniel Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM\u00a030(2) (1983)","journal-title":"Journal of the ACM"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-642-16242-8_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Claire David","year":"2010","unstructured":"David, C., Libkin, L., Tan, T.: On the satisfiability of two-variable logic over data words. In: Ferm\u00fcller, C., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 248\u2013262. Springer, Heidelberg (2010)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"St\u00e9phane Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic\u00a010(3) (2009)","journal-title":"ACM Transactions on Computational Logic"},{"key":"12_CR12","unstructured":"Hanf, W.: Model-theoretic methods in the study of elementary logic. In: Addison, J.W., Henkin, L., Tarski, A. (eds.) The Theory of Models. North-Holland, Amsterdam (1965)"},{"issue":"2","key":"12_CR13","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"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1142\/S0129054110007532","volume":"21","author":"M. Kaminski","year":"2010","unstructured":"Kaminski, M., Zeitlin, D.: Finite-memory automata with non-deterministic reassignment. International Journal of Foundations of Computer Science\u00a021(5), 741\u2013760 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"12_CR15","unstructured":"Kara, A., Schwentick, T., Zeume, T.: Temporal logics on words with multiple data values. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2010. LIPIcs, vol.\u00a08, pp. 481\u2013492 (2010)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-36206-1_23","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"M. Leucker","year":"2002","unstructured":"Leucker, M., Madhusudan, P., Mukhopadhyay, S.: Dynamic message sequence charts. In: Agrawal, M., Seth, A. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 253\u2013264. Springer, Heidelberg (2002)"},{"issue":"3","key":"12_CR17","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"},{"issue":"3","key":"12_CR18","first-page":"109","volume":"3","author":"T. Schwentick","year":"1999","unstructured":"Schwentick, T., Barthelmann, K.: Local normal forms for first-order logic with applications to games and automata. Discrete Mathematics & Theoretical Computer Science\u00a03(3), 109\u2013124 (1999)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"12_CR20","unstructured":"Thomas, W.: Elements of an automata theory over partial orders. In: POMIV 1996. DIMACS, vol.\u00a029. AMS, Providence (1996)"},{"key":"12_CR21","first-page":"295","volume-title":"POPL 2011","author":"N. Tzevelekos","year":"2011","unstructured":"Tzevelekos, N.: Fresh-register automata. In: Ball, T., Sagiv, M. (eds.) POPL 2011, pp. 295\u2013306. ACM, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T08:20:45Z","timestamp":1741508445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}