{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:05Z","timestamp":1725564965391},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_20","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"171-178","source":"Crossref","is-referenced-by-count":1,"title":["Regular Expressions for Languages over Infinite Alphabets"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kaminski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/3-540-45465-9_65","volume-title":"Automata, Languages and Programming","author":"M. Bielecki","year":"2002","unstructured":"Bielecki, M., Hidders, J., Paredaens, J., Tyszkiewicz, J., Van den Bussch, J.: Navigating with a browser. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 764\u2013775. Springer, Heidelberg (2002)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bolling, B., Leucker, M., Noll, T.: Generalized regular MSA languages. Technical report, Department of Computer Science, Aachen University of Technology (2002)","DOI":"10.1007\/3-540-45931-6_5"},{"key":"20_CR3","first-page":"683","volume-title":"Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Kaminski","year":"1990","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, Los Alamitis, CA, pp. 683\u2013688. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"138","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science A\u00a0138, 329\u2013363 (1994)","journal-title":"Theoretical Computer Science A"},{"key":"20_CR5","volume-title":"Elements of the theory of computation","author":"H.R. Lewis","year":"1981","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the theory of computation. Prentice-Hall, Inc., Englewood Cliffs (1981)"},{"key":"20_CR6","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., Schwentik, 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":"20_CR7","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. Information and Computation\u00a0114, 192\u2013213 (1994)","journal-title":"Information and Computation"},{"key":"20_CR8","unstructured":"Tal. Decidability of inclusion for unification based automata. M.Sc. thesis, Department of Computer Science, Technion \u2013 Israel Institute of Technology (1999)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:10Z","timestamp":1605759670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}