{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:29:18Z","timestamp":1760016558926,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_30","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"351-362","source":"Crossref","is-referenced-by-count":6,"title":["Feasible Automata for Two-Variable Logic with Successor on Data Words"],"prefix":"10.1007","author":[{"given":"Ahmet","family":"Kara","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4-5","key":"30_CR1","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. Theor. Comput. Sci.\u00a0411(4-5), 702\u2013715 (2010)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Boasson, L.: Some applications of CFL\u2019s over infinte alphabets. Theoretical Computer Science, 146\u2013151 (1981)","key":"30_CR2","DOI":"10.1007\/BFb0017306"},{"doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM\u00a056(3) (2009)","key":"30_CR3","DOI":"10.1145\/1516512.1516515"},{"doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316 (2006)","key":"30_CR4","DOI":"10.1109\/LICS.2006.51"},{"doi-asserted-by":"crossref","unstructured":"Bollig, B.: An automaton over data words that captures EMSO logic. CoRR abs\/1101.4475 (2011)","key":"30_CR5","DOI":"10.1007\/978-3-642-23217-6_12"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundl. Math."},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"E.Y.C. Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf.\u00a035(3), 245\u2013267 (1998)","journal-title":"Acta Inf."},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-3-642-22993-0_24","volume-title":"MFCS 2011","author":"T. Colcombet","year":"2011","unstructured":"Colcombet, T., Ley, C., Puppis, G.: On the Use of Guards for Logics with Data. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 243\u2013255. Springer, Heidelberg (2011)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-16242-8_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. David","year":"2010","unstructured":"David, C., Libkin, L., Tan, T.: On the Satisfiability of Two-Variable Logic over Data Words. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 248\u2013262. Springer, Heidelberg (2010)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-72734-7_13","volume-title":"Logical Foundations of Computer Science","author":"S. Demri","year":"2007","unstructured":"Demri, S., D\u2019Souza, D., Gascon, R.: A Decidable Temporal Logic of Repeating Values. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 180\u2013194. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log.\u00a010(3) (2009)","key":"30_CR11","DOI":"10.1145\/1507244.1507246"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Transactions of The American Mathematical Society\u00a098, 21 (1961)","journal-title":"Transactions of The American Mathematical Society"},{"issue":"9","key":"30_CR13","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1145\/358746.358767","volume":"24","author":"J.L. Gischer","year":"1981","unstructured":"Gischer, J.L.: Shuffle languages, Petri nets, and context-sensitive grammars. Commun. ACM\u00a024(9), 597\u2013605 (1981)","journal-title":"Commun. ACM"},{"issue":"1-2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00308-9","volume":"224","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Otto, M.: On logics with two variables. Theor. Comput. Sci.\u00a0224(1-2), 73\u2013113 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"30_CR15","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. Theor. Comput. Sci.\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"30_CR16","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FUN-2006-69304","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundam. Inform.\u00a069(3), 301\u2013318 (2006)","journal-title":"Fundam. Inform."},{"unstructured":"Kara, A., Schwentick, T., Tan, T.: Feasible automata for two-variable logic with successor on data words, arXiv:1110.1221v1","key":"30_CR17"},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1877714.1877716","volume":"12","author":"R. Lazic","year":"2011","unstructured":"Lazic, R.: Safety alternating automata on data words. ACM Trans. Comput. Log.\u00a012(2), 10 (2011)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"30_CR19","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 Trans. Comput. Log.\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"doi-asserted-by":"crossref","unstructured":"Niewerth, M., Schwentick, T.: Two-variable logic and key constraints on data words. In: ICDT, pp. 138\u2013149 (2011)","key":"30_CR20","DOI":"10.1145\/1938551.1938571"},{"issue":"1","key":"30_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0166-218X(85)90039-3","volume":"12","author":"F. Otto","year":"1985","unstructured":"Otto, F.: Classes of regular and context-free languages over countably infinite alphabets. Discrete Applied Mathematics\u00a012(1), 41\u201356 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"30_CR23","first-page":"326","volume":"140","author":"B. Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.: Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR\u00a0140, 326\u2013329 (1961)","journal-title":"Doklady Akademii Nauk SSSR"},{"doi-asserted-by":"crossref","unstructured":"Wu, Z.: A decidable extension of data automata. In: GandALF, pp. 116\u2013130 (2011)","key":"30_CR24","DOI":"10.4204\/EPTCS.54.9"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T06:19:31Z","timestamp":1742624371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}