{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:25:00Z","timestamp":1742948700145,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_6","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"91-102","source":"Crossref","is-referenced-by-count":1,"title":["$$\\mathbb {N}$$ -Memory Automata over the Alphabet $$\\mathbb {N}$$"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Br\u00fctsch","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Landwehr","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"6_CR1","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 Comput. Sci. 4(1) (2008)","DOI":"10.2168\/LMCS-4(1:8)2008"},{"issue":"4","key":"6_CR2","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 Trans. Comput. Logic 12(4), 27 (2011)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logical Methods Comput. Sci. 10(3) (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00fctsch, B., Thomas, W.: Playing games in the Baire space. In: Brihaye, T., Delahaye, B., Jezequel, L., Markey, N., Srba, J. (eds.) Proceedings of Cassting Workshop on Games for the Synthesis of Complex Systems, EPTCS, vol. 220, pp. 13\u201325 (2016)","DOI":"10.4204\/EPTCS.220.2"},{"key":"6_CR5","first-page":"1","volume-title":"Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, Studies in Logic and the Foundations of Mathematics","author":"JR B\u00fcchi","year":"1966","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Nagel, E., Suppes, P., Tarski, A. (eds.) Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, Studies in Logic and the Foundations of Mathematics, vol. 44, pp. 1\u201311. Elsevier, Amsterdam (1966)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-20297-6_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"C Carapelle","year":"2015","unstructured":"Carapelle, C., Feng, S., Kartzow, A., Lohrey, M.: Satisfiability of ECTL* with tree constraints. In: Beklemishev, L.D., Musatov, D.V. (eds.) CSR 2015. LNCS, vol. 9139, pp. 94\u2013108. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-20297-6_7"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-21500-6_16","volume-title":"Developments in Language Theory","author":"C Czyba","year":"2015","unstructured":"Czyba, C., Spinrath, C., Thomas, W.: Finite automata over infinite alphabets: two models with transitions for local change. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 203\u2013214. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21500-6_16"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389\u2013418 (1967)","journal-title":"J. ACM"},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"6_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. 4207, pp. 41\u201357. Springer, Heidelberg (2006). doi: 10.1007\/11874683_3"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Spelten, A., Thomas, W., Winter, S.: Trees over infinite structures and path logics with synchronization. In: Yu, F., Wang, C. (eds.) Proceedings of INFINITY 2011, EPTCS, vol. 73, pp. 20\u201334 (2011)","DOI":"10.4204\/EPTCS.73.5"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Tan, T.: An automata model for trees with ordered data values. In: Proceedings of LICS 2012, pp. 586\u2013595. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.69"},{"issue":"1","key":"6_CR13","first-page":"8","volume":"15","author":"T Tan","year":"2014","unstructured":"Tan, T.: Extending two-variable logic on data trees with order on data values and its automata. ACM Trans. Comput. Log. 15(1), 8 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR14","doi-asserted-by":"crossref","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, Berlin (1997)"}],"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-319-53733-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:35:53Z","timestamp":1498372553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}