{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:41:46Z","timestamp":1759333306355},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_60","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"712-723","source":"Crossref","is-referenced-by-count":6,"title":["On Pebble Automata for Data Languages with Decidable Emptiness Problem"],"prefix":"10.1007","author":[{"given":"Tony","family":"Tan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-74240-1_9","volume-title":"Fundamentals of Computation Theory","author":"H. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On Notions of Regularity for Data Languages. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 88\u201399. Springer, Heidelberg (2007)"},{"key":"60_CR2","doi-asserted-by":"crossref","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 2006), pp. 7\u201316 (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"60_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11786986_15","volume-title":"Automata, Languages and Programming","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Samuelides, M., Schwentick, T., Segoufin, L.: Expressive Power of Pebble Automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 157\u2013168. Springer, Heidelberg (2006)"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R.: LTL with the Freeze Quantifier and Register Automata. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 17\u201326 (2006)","DOI":"10.1109\/LICS.2006.31"},{"key":"60_CR5","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, 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"60_CR6","unstructured":"Kaminski, M., Tan, T.: A Note on Two-Pebble Automata over Infinite Alphabets. Technical Report CS-2009-02, Department of Computer Science, Technion \u2013 Israel Institute of Technology (2009)"},{"issue":"1-3","key":"60_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science\u00a0297(1-3), 337\u2013354 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"60_CR8","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":"5","key":"60_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters\u00a083(5), 251\u2013261 (2002)","journal-title":"Information Processing Letters"},{"key":"60_CR10","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":"60_CR11","doi-asserted-by":"crossref","unstructured":"Tan, T.: Graph Reachability and Pebble Automata over Infinite Alphabets. To appear in the Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS 2009)","DOI":"10.1109\/LICS.2009.23"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:01:33Z","timestamp":1552136493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}