{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:53Z","timestamp":1760202713334},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_1","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T11:52:20Z","timestamp":1467719540000},"page":"3-11","source":"Crossref","is-referenced-by-count":2,"title":["Decision Problems for Finite Automata over Infinite Algebraic Structures"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5771, pp. 86\u2013101. Springer, Heidelberg (2009)"},{"issue":"1","key":"1_CR2","doi-asserted-by":"crossref","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. Bull. Am. Math. Soc. 21(1), 1\u201346 (1989)","journal-title":"Bull. Am. Math. Soc."},{"key":"1_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 (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., David, C., Muscholl, M., Schwentick, T., Segoufin, L.: Two-variablelogic on data trees and XML reasoning. In: Proceedings of PODS 2006, pp. 10\u201319 (2006)","DOI":"10.1145\/1142351.1142354"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., de Naurois, P.J., Marion, J.-Y.: Computability over an arbitrary structure. Sequential and parallel polynomial time. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 185\u2013199. Springer, Heidelberg (2003)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 4052, pp. 577\u2013588. Springer, Heidelberg (2006)"},{"issue":"1\u20133","key":"1_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0168-0072(97)00039-0","volume":"90","author":"C Calude","year":"1997","unstructured":"Calude, C., Calude, E., Khoussainov, B.: Deterministic automata: simulation and minimality. Ann. Pure Appl. Logic 90(1\u20133), 263\u2013276 (1997)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20132","key":"1_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0304-3975(98)00221-7","volume":"242","author":"C Calude","year":"2000","unstructured":"Calude, C., Calude, E., Khoussainov, B.: Finite nondeterministic automata: simulation and minimality. Theor. Comput. Sci. 242(1\u20132), 219\u2013235 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"1_CR10","unstructured":"Figueira, D.: Reasoning on words and trees with data. Ph.D. thesis, ENS Cachan, France (2010)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-29952-0_37","volume-title":"Theory and Applications of Models of Computation","author":"A Gandhi","year":"2012","unstructured":"Gandhi, A., Khoussainov, B., Liu, J.: Finite automata over structures (Extended Abstract). In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 373\u2013384. Springer, Heidelberg (2012)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","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 25(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR13","doi-asserted-by":"crossref","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. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR14","unstructured":"Khoussainov, B., Nerode, A.: Open questions in the theory of automatic structures. Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) (94):181\u2013204 (2008)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3707, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"key":"1_CR16","volume-title":"Hilbert\u2019s Tenth Problem","author":"Y Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.: Hilbert\u2019s Tenth Problem. MIT Press, Massachusetts (1993)"},{"issue":"3","key":"1_CR17","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of post\u2019s problem of \u201cTag\u201d and other topics in theory of turing machines. Ann. Math. 74(3), 437\u2013455 (1961)","journal-title":"Ann. Math."},{"issue":"C","key":"1_CR18","first-page":"86","volume":"591","author":"K Meer","year":"2015","unstructured":"Meer, K., Naif, A.: Generalised finite automata over real and complex numbers. Theor. Comput. Sci. 591(C), 86\u201398 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-319-30000-9_13","volume-title":"Language and Automata Theory and Applications","author":"K Meer","year":"2016","unstructured":"Meer, K., Naif, A.: Periodic generalized automata over the reals. In: Dediu, A.-H., et al. (eds.) LATA 2016. LNCS, vol. 9618, pp. 168\u2013180. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30000-9_13"},{"issue":"3","key":"1_CR20","doi-asserted-by":"crossref","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 Trans. Comput. Logic 15(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 4207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"1_CR22","unstructured":"Segoufin, L., Torunczyk, S.: Automata based verification over linearly ordered data domains. In: Proceedings of STACS, pp. 81\u201392. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Tan, T.: Graph reachability and pebble automata over infinite alphabets. In: Proceedings of LICS, pp. 157\u2013166. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.23"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T18:29:11Z","timestamp":1568140151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}