{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:13:57Z","timestamp":1767237237478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"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_25","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"295-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Emptiness and Membership Problems for Set Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8850-9749","authenticated-orcid":false,"given":"A.","family":"Rubtsov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9822-1060","authenticated-orcid":false,"given":"M.","family":"Vyalyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, SFCS 1977, pp. 254\u2013266. IEEE Computer Society, Washington, D.C. (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-09698-8_27","volume-title":"Developments in Language Theory","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Deterministic set automata. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 303\u2013314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09698-8_27"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-09704-6_25","volume-title":"Descriptional Complexity of Formal Systems","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Regularity and size of set automata. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 282\u2013293. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09704-6_25"},{"issue":"02","key":"25_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0129054116400062","volume":"27","author":"M Kutrib","year":"2016","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Set automata. Int. J. Found. Comput. Sci. 27(02), 187\u2013214 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-55808-X_33","volume-title":"Mathematical Foundations of Computer Science 1992","author":"K-J Lange","year":"1992","unstructured":"Lange, K.-J., Rossmanith, P.: The emptiness problem for intersections of regular languages. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 346\u2013354. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_33"},{"key":"25_CR6","first-page":"321","volume-title":"Combinatorics, Complexity, Logic. Proceedings of the DMTCS 1996","author":"K-J Lange","year":"1996","unstructured":"Lange, K.-J., Reinhardt, K.: Set automata. In: Bridges, D.S., Calude, C., Gibbons, J., Reeves, S., Witten, L. (eds.) Combinatorics, Complexity, Logic. Proceedings of the DMTCS 1996, pp. 321\u2013329. Springer, Heidelberg (1996)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-62809-7_25","volume-title":"Developments in Language Theory","author":"AA Rubtsov","year":"2017","unstructured":"Rubtsov, A.A., Vyalyi, M.N.: On computational complexity of set automata. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 332\u2013344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_25"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:31:00Z","timestamp":1710243060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}