{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:56:12Z","timestamp":1743000972195,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68195-1_1","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Language Varieties Without Boolean Operations"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Birkmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2021-1644","authenticated-orcid":false,"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Milius, S., Myers, R., Urbat, H.: Generalized Eilenberg theorem: varieties of languages in a category. ACM Trans. Comput. Log. 20(1), 3:1\u20133:47 (2019)","DOI":"10.1145\/3276771"},{"key":"1_CR2","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata and quantum computing (2018). https:\/\/arxiv.org\/abs\/1507.01988"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic results on quantum automata. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 93\u2013104. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_9","DOI":"10.1007\/978-3-540-24749-4_9"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Ambainis1, A., \u0136ikusts, A., Valdats, M.: On the class of languages recognizable by 1-way quantum finite automata. In: Ferreira, A. Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 75\u201386. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44693-1_7","DOI":"10.1007\/3-540-44693-1_7"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-21500-6_1","volume-title":"Developments in Language Theory","author":"M Boja\u0144czyk","year":"2015","unstructured":"Boja\u0144czyk, M.: Recognisable languages over monads. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 1\u201313. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_1"},{"key":"1_CR6","first-page":"73","volume":"31","author":"A Brodsky","year":"1999","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31, 73\u201391 (1999)","journal-title":"SIAM J. Comput."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-662-49630-5_31","volume-title":"Foundations of Software Science and Computation Structures","author":"L-T Chen","year":"2016","unstructured":"Chen, L.-T., Ad\u00e1mek, J., Milius, S., Urbat, H.: Profinite monads, profinite equations, and Reiterman\u2019s theorem. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 531\u2013547. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_31"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2 edn. Cambridge University Press, Cambridge (2002)","DOI":"10.1017\/CBO9780511809088"},{"key":"1_CR9","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Cambridge (1974)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 246\u2013257. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_21"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/11809678_11","volume-title":"Computing and Combinatorics","author":"M Golovkins","year":"2006","unstructured":"Golovkins, M., Pin, J.-E.: Varieties generated by certain models of reversible finite automata. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 83\u201393. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11809678_11"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2019.10.020","volume":"800","author":"O Kl\u00edma","year":"2019","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: Syntactic structures of regular languages. Theoret. Comput. Sci. 800, 125\u2013141 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR13","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the FOCS, pp. 66\u201375. IEEE (1997)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1090\/S0002-9939-1979-0524290-9","volume":"74","author":"G Markowsky","year":"1979","unstructured":"Markowsky, G.: Free completely distributive lattices. Proc. Amer. Math. Soc. 74, 227\u2013228 (1979)","journal-title":"Proc. Amer. Math. Soc."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-030-17127-8_23","volume-title":"Foundations of Software Science and Computation Structures","author":"S Milius","year":"2019","unstructured":"Milius, S., Urbat, H.: Equational axiomatization of algebras with structure. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 400\u2013417. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_23"},{"key":"1_CR16","first-page":"80","volume":"39","author":"JE Pin","year":"1995","unstructured":"Pin, J.E.: A variety theorem without complementation. Russ. Math. 39, 80\u201390 (1995)","journal-title":"Russ. Math."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-44683-4_53","volume-title":"Mathematical Foundations of Computer Science 2001","author":"L Pol\u00e1k","year":"2001","unstructured":"Pol\u00e1k, L.: Syntactic semiring of a language. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 611\u2013620. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_53"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02483902","volume":"14","author":"J Reiterman","year":"1982","unstructured":"Reiterman, J.: The Birkhoff theorem for finite algebras. Algebra Universalis 14(1), 1\u201310 (1982). https:\/\/doi.org\/10.1007\/BF02483902","journal-title":"Algebra Universalis"},{"key":"1_CR19","unstructured":"Salamanca, J.: Unveiling Eilenberg-type correspondences: Birkhoff\u2019s theorem for (finite) algebras + duality (2017). https:\/\/arxiv.org\/abs\/1702.02822"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inform. Control 8(2), 190\u2013194 (1965)","journal-title":"Inform. Control"},{"key":"1_CR21","unstructured":"Urbat, H., Ad\u00e1mek, J., Chen, L.T., Milius, S.: Eilenberg theorems for free. In: Proceedings of the MFCS. LIPIcs, vol. 83, pp. 43:1\u201343:14 (2017)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Wilke, T.: An Eilenberg theorem for infinity-languages. In: Proceedings of the ICALP. LNCS, vol. 510, pp. 588\u2013599. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54233-7_166"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68195-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:10:50Z","timestamp":1613952650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}