{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:55Z","timestamp":1759638835776,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_37","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"373-384","source":"Crossref","is-referenced-by-count":5,"title":["Finite Automata over Structures"],"prefix":"10.1007","author":[{"given":"Aniruddh","family":"Gandhi","sequence":"first","affiliation":[]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-04027-6_9","volume-title":"Computer Science Logic","author":"R. Alur","year":"2009","unstructured":"Alur, R., \u010cern\u00fd, P., Weinstein, S.: Algorithmic Analysis of Array-Accessing Programs. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 86\u2013101. Springer, Heidelberg (2009)"},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a Theory of Computation and Complexity over the Real Numbers: NP-completeness, Recursive Functions and Universal Machines. Bulletin of the American Mathematical Society\u00a021(1), 1\u201346 (1989)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-Variable Logic on Words with Data. In: Proceedings of LICS 2006, pp. 7\u201316. IEEE Computer Society (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., David, C., Muscholl, M., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: Proceedings of PODS 2006, pp. 10\u201319. ACM (2006)","DOI":"10.1145\/1142351.1142354"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36576-1_12","volume-title":"Foundations of Software Science and Computational Structures","author":"O. Bournez","year":"2003","unstructured":"Bournez, O., Cucker, F., Jacob\u00e9 de Naurois, P., Marion, J.-Y.: Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 185\u2013199. Springer, Heidelberg (2003)"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/11787006_49","volume-title":"Automata, Languages and Programming","author":"M. Bozga","year":"2006","unstructured":"Bozga, M., Iosif, R., Lakhnech, Y.: Flat Parametric Counter Automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 577\u2013588. Springer, Heidelberg (2006)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"S. Comon","year":"1998","unstructured":"Comon, S., Jurski, Y.: Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Ershov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J.: Handbook of Recursive Mathematics: Recursive Model Theory. Studies in Logic and the Foundations of Mathematics. North-Holland (1998)","DOI":"10.1016\/S0049-237X(98)80045-1"},{"key":"37_CR9","unstructured":"Figueira, D.: Reasoning on words and trees with data. Ph.D. Thesis, ENS Cachan, France (2010)"},{"issue":"1","key":"37_CR10","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. Ibarra","year":"1978","unstructured":"Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminsky","year":"1994","unstructured":"Kaminsky, M., Francez, N.: Finite memory automata. Theor. Comp. Sci.\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theor. Comp. Sci."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Ishihara, H., Khousainov, B., Rubin, S.: Some Results on Automatic Structures. In: Proceedings of LICS 2002, p. 235. IEEE Computer Society (2002)","DOI":"10.1109\/LICS.2002.1029832"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The general vector addition system reachability problem by presburger inductive invariants. In: Procedings of LICS 2009, pp. 4\u201313. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.10"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11562948_36","volume-title":"Automated Technology for Verification and Analysis","author":"J. Leroux","year":"2005","unstructured":"Leroux, J., Sutre, G.: Flat Counter Automata Almost Everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"key":"37_CR15","volume-title":"Hilbert\u2019s Tenth Problem","author":"Y. Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge (1993)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of \u201cTag\u201d and other topics in theory of Turing machines. Annals of Math.\u00a074(3) (1961)","DOI":"10.2307\/1970290"},{"issue":"3","key":"37_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"15","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Tran. Comput. Logic\u00a015(3), 403\u2013435 (2004)","journal-title":"ACM Tran. Comput. Logic"},{"issue":"3","key":"37_CR18","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.2307\/2586704","volume":"65","author":"F. Point","year":"2000","unstructured":"Point, F.: On Decidable Extensions of Presburger Arithmetic: From A. Bertrand Numeration Systems to Pisot Numbers. J. Symb. Log.\u00a065(3), 1347\u20131374 (2000)","journal-title":"J. Symb. Log."},{"key":"37_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":"37_CR20","unstructured":"Segoufin, L., Torunczyk, S.: Automata based verification over linearly ordered data domains. In: Proceedings of STACS 2011. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 81\u201392 (2011)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Tan, T.: Graph reachability and pebble automata over infinite alphabets. In: Proceedings of LICS 2009, pp. 157\u2013166. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.23"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:10Z","timestamp":1743044050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}