{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:43:59Z","timestamp":1743057839010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_16","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"203-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Czyba","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Spinrath","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"B\u00e8s, A.: An application of the feferman-vaught theorem to automata and logics for words over an infinite alphabet. Logical Methods in Computer Science 4(1) (2008)","key":"16_CR1","DOI":"10.2168\/LMCS-4(1:8)2008"},{"doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: IEEE Conference Record of the Eighth Annual Symposium on Switching and Automata Theory, SWAT 1967, pp. 155\u2013160. IEEE (1967)","key":"16_CR2","DOI":"10.1109\/FOCS.1967.6"},{"unstructured":"Blumensath, A., Colcombet, T., L\u00f6ding, C.: Logical theories and compatible operations. In: Flum, J., et al. (eds.) Logic and Automata: History and Perspectives, pp. 73\u2013106. Amsterdam Univ. Press (2008)","key":"16_CR3"},{"issue":"4","key":"16_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Transactions on Computational Logic (TOCL) 12(4), 27 (2011)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"doi-asserted-by":"crossref","unstructured":"Czyba, C., Spinrath, C., Thomas, W.: Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Full Version). RWTH Aachen University (2015). https:\/\/www.lii.rwth-aachen.de\/en\/86-finite-automata-over-infinite-alphabets.html","key":"16_CR5","DOI":"10.1007\/978-3-319-21500-6_16"},{"unstructured":"Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer Undergraduate Texts in Mathematics and Technology. Springer (1996)","key":"16_CR6"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(80)90151-9","volume":"10","author":"K Inoue","year":"1980","unstructured":"Inoue, K., Takanami, I.: A note on decision problems for three-way two-dimensional finite automata. Information Processing Letters 10(4), 245\u2013248 (1980)","journal-title":"Information Processing Letters"},{"issue":"2","key":"16_CR8","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 134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","volume-title":"Computation: finite and infinite machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall Inc, Upper Saddle River (1967)"},{"unstructured":"Rosenfeld, A.: Picture languages. Academic Press (1979)","key":"16_CR10"},{"key":"16_CR11","first-page":"20","volume-title":"Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011","author":"A Spelten","year":"2011","unstructured":"Spelten, A., Thomas, W., Winter, S.: Trees over infinite structures and path logics with synchronization. In: Yu, F., Wang, C. (eds.) Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, vol. 73, pp. 20\u201334. EPTCS, Taipei (2011)"},{"unstructured":"Spelten, A.: Paths in Infinite Trees: Logics and Automata. PhD thesis, RWTH-Aachen University (2013)","key":"16_CR12"},{"issue":"02","key":"16_CR13","doi-asserted-by":"publisher","first-page":"334","DOI":"10.2307\/2273193","volume":"45","author":"W Thomas","year":"1980","unstructured":"Thomas, W.: On the bounded monadic theory of well-ordered structures. The Journal of Symbolic Logic 45(02), 334\u2013338 (1980)","journal-title":"The Journal of Symbolic Logic"},{"key":"16_CR14","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, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:50:09Z","timestamp":1676973009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}