{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:30:20Z","timestamp":1739338220119,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044199"},{"type":"electronic","value":"9783642044205"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04420-5_14","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T02:17:25Z","timestamp":1251339445000},"page":"141-153","source":"Crossref","is-referenced-by-count":3,"title":["Counting Multiplicity over Infinite Alphabets"],"prefix":"10.1007","author":[{"given":"Amaldev","family":"Manuel","sequence":"first","affiliation":[]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(80)90050-5","volume":"2","author":"J.-M. Autebert","year":"1980","unstructured":"Autebert, J.-M., Beauquier, J., Boasson, L.: Langages sur des alphabets infinis. Discrete Applied Mathematics\u00a02, 1\u201320 (1980)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"14_CR3","unstructured":"Baclet, M.: Logical characterization of aperiodic data languages. Research Report LSV-03-12, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, 16 p. (September 2003)"},{"key":"14_CR4","first-page":"7","volume-title":"LICS","author":"M. Bojanczyk","year":"2006","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","volume":"84","author":"P. Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Inf. Process. Lett.\u00a084(2), 75\u201385 (2002)","journal-title":"Inf. Process. Lett."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-44685-0_17","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Bouyer","year":"2001","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic characterization of data and timed languages. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 248\u2013261. Springer, Heidelberg (2001)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-74240-1_9","volume-title":"Fundamentals of Computation Theory","author":"H. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 88\u201399. Springer, Heidelberg (2007)"},{"key":"14_CR8","first-page":"17","volume-title":"LICS 2006: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lazic, R.: Ltl with the freeze quantifier and register automata. In: LICS 2006: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pp. 17\u201326. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"2","key":"14_CR9","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. Theor. Comput. Sci.\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"14_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FUN-2006-69304","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundam. Inform.\u00a069(3), 301\u2013318 (2006)","journal-title":"Fundam. Inform."},{"key":"14_CR11","unstructured":"Lipton, R.: The reachability problem requires exponential space. Research Report\u00a062, Yale University (1976)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Lisitsa, A., Potapov, I.: Temporal logic with predicate lambda-abstraction. In: TIME, pp. 147\u2013155 (2005)","DOI":"10.1109\/TIME.2005.34"},{"issue":"2","key":"14_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3233\/FI-2009-0049","volume":"91","author":"A. Lisitsa","year":"2009","unstructured":"Lisitsa, A., Potapov, I.: On the computational power of querying the history. Fundam. Inform.\u00a091(2), 395\u2013409 (2009)","journal-title":"Fundam. Inform."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Lisitsa, A., Potapov, I., Saleh, R.: Automata on gauss words. In: LATA, pp. 505\u2013517 (2009)","DOI":"10.1007\/978-3-642-00982-2_43"},{"key":"14_CR15","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)"},{"issue":"3","key":"14_CR16","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(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0166-218X(85)90039-3","volume":"12","author":"F. Otto","year":"1985","unstructured":"Otto, F.: Classes of regular and context-free languages over countably infinite alphabets. Discrete Applied Mathematics\u00a012, 41\u201356 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR18","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)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04420-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:47:25Z","timestamp":1739310445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04420-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044199","9783642044205"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04420-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}