{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:34:19Z","timestamp":1780382059534,"version":"3.54.1"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319905297","type":"print"},{"value":"9783319905303","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_13","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Closure Under Reversal of Languages over Infinite Alphabets"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Genkin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liat","family":"Peterfreund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2014.01.020","volume":"526","author":"D Genkin","year":"2014","unstructured":"Genkin, D., Kaminski, M., Peterfreund, L.: A note on the emptiness problem for alternating finite-memory automata. Theoret. Comput. Sci. 526, 97\u2013107 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, pp. 683\u2013688. IEEE Computer Society Press (1990)","DOI":"10.1109\/FSCS.1990.89590"},{"key":"13_CR3","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. 134, 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2010-234","volume":"98","author":"M Kaminski","year":"2010","unstructured":"Kaminski, M., Tan, T.: A note on two-pebble automata over infinite alphabets. Fundam. Inform. 98, 1\u201312 (2010)","journal-title":"Fundam. Inform."},{"key":"13_CR5","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. 2136, pp. 560\u2013572. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_49"},{"key":"13_CR6","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. 5, 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR7","unstructured":"Peterfreund, L.: Closure under reversal of languages over infinite alphabets: a case study. Master\u2019s thesis, Department of Computer Science, Technion - Israel Institute of Technology (2015). http:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-get.cgi\/2015\/MSC\/MSC-2015-20"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.jcss.2010.03.004","volume":"76","author":"T Tan","year":"2010","unstructured":"Tan, T.: On pebble automata for data languages with decidable emptiness problem. J. Comput. Syst. Sci. 76, 778\u2013791 (2010)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T22:09:49Z","timestamp":1751580589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}