{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:09Z","timestamp":1725796809853},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319088457"},{"type":"electronic","value":"9783319088464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08846-4_23","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T11:56:43Z","timestamp":1404475003000},"page":"304-317","source":"Crossref","is-referenced-by-count":0,"title":["Weighted Variable Automata over Infinite Alphabets"],"prefix":"10.1007","author":[{"given":"Maria","family":"Pittou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Rahonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2012.12.036","volume":"474","author":"P. Barcel\u00f3","year":"2013","unstructured":"Barcel\u00f3, P., Reutter, J., Libkin, L.: Parametrized regular expressions and their languages. Theoret. Comput. Sci.\u00a0474, 21\u201345 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"23_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. Log.\u00a012(4), 27 (2011)","journal-title":"ACM Trans. Comput. Log."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"\u010cern\u00fd, P., Gopi, S., Henzinger, T.A., Radhakrishna, A., Totla, N.: Synthesis from incompatible specifications. In: Proceedings of EMSOFT 2012, pp. 53\u201362. ACM Press (2012)","DOI":"10.1145\/2380356.2380371"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/11963516_23","volume-title":"Membrane Computing","author":"J. Dassow","year":"2006","unstructured":"Dassow, J., Vaszil, G.: P finite automata and regular languages over countably infinite alphabets. In: Hoogeboom, H.J., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol.\u00a04361, pp. 367\u2013381. Springer, Heidelberg (2006)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Droste, M., Meinecke, I.: Weighted automata and weighted MSO logics for average and long-time behaviors. Inform. and Comput. 220-221, 44\u201359 (2012)","DOI":"10.1016\/j.ic.2012.10.001"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"key":"23_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. Theoret. Comput. Sci.\u00a0134, 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR9","first-page":"301","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fund. Inform.\u00a069, 301\u2013318 (2006)","journal-title":"Fund. Inform."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Mens, I.-.E.: Tree automata over infinite ranked alphabets. Master thesis, Thessaloniki (2011), http:\/\/invenio.lib.auth.gr\/record\/128884\/files\/GRI-2012-8361.pdf","DOI":"10.1007\/978-3-642-21493-6_16"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-21493-6_16","volume-title":"Algebraic Informatics","author":"I.-.E. Mens","year":"2011","unstructured":"Mens, I.-.E., Rahonis, G.: Variable tree automata over infinite ranked alphabets. In: Winkler, F. (ed.) CAI 2011. LNCS, vol.\u00a06742, pp. 247\u2013260. Springer, Heidelberg (2011)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-44683-4_49","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F. Neven","year":"2001","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 560\u2013572. Springer, Heidelberg (2001)"},{"key":"23_CR13","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 Trans. Comput. Log.\u00a05, 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1006\/inco.1994.1085","volume":"114","author":"Y. Shemesh","year":"1994","unstructured":"Shemesh, Y., Francez, N.: Finite-state unification automata and relational languages. Inform. and Comput.\u00a0114, 192\u2013213 (1994)","journal-title":"Inform. and Comput."}],"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-08846-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T13:33:36Z","timestamp":1649597616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08846-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088457","9783319088464"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08846-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}