{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:22:54Z","timestamp":1780050174567,"version":"3.53.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031095733","type":"print"},{"value":"9783031095740","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_20","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"320-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Characterizing Level One in\u00a0Group-Based Concatenation Hierarchies"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Place","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BFb0039607","volume-title":"STACS 1987","author":"M Arfi","year":"1987","unstructured":"Arfi, M.: Polynomial operations on rational languages. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 198\u2013206. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0039607"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0218196791000079","volume":"1","author":"CJ Ash","year":"1991","unstructured":"Ash, C.J.: Inevitable graphs: a proof of the type II conjecture and some related decision procedures. Int. J. Algebra Comput. 1(1), 127\u2013146 (1991)","journal-title":"Int. J. Algebra Comput."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(71)80006-5","volume":"5","author":"JA Brzozowski","year":"1971","unstructured":"Brzozowski, J.A., Cohen, R.S.: Dot-depth of star-free events. J. Comput. Syst. Sci. 5(1), 1\u201316 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Chaubard, L., \u00c9ric Pin, J., Straubing, H.: First order formulas with modular predicates. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 211\u2013220 (2006)","DOI":"10.1109\/LICS.2006.24"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0218196791000298","volume":"1","author":"K Henckell","year":"1991","unstructured":"Henckell, K., Margolis, S., Pin, J.E., Rhodes, J.: Ash\u2019s type II theorem, profinite topology and Malcev products. Int. J. Algebra Comput. 1, 411\u2013436 (1991)","journal-title":"Int. J. Algebra Comput."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1051\/ita\/1983170403211","volume":"17","author":"R Knast","year":"1983","unstructured":"Knast, R.: A semigroup characterization of dot-depth one languages. RAIRO - Theoret. Inform. App. 17(4), 321\u2013330 (1983)","journal-title":"RAIRO - Theoret. Inform. App."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(99)00278-9","volume":"245","author":"A Maciel","year":"2000","unstructured":"Maciel, A., P\u00e9ladeau, P., Th\u00e9rien, D.: Programs over semigroups of dot-depth one. Theoret. Comput. Sci. 245(1), 135\u2013148 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0028813","volume-title":"Fundamentals of Computation Theory","author":"SW Margolis","year":"1985","unstructured":"Margolis, S.W., Pin, J.E.: Products of group languages. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 285\u2013299. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/BFb0028813"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0304-3975(01)00230-4","volume":"292","author":"JE Pin","year":"2003","unstructured":"Pin, J.E.: Algebraic tools for the concatenation product. Theoret. Comput. Sci. 292, 317\u2013342 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-38771-5_5","volume-title":"Developments in Language Theory","author":"J\u00c9 Pin","year":"2013","unstructured":"Pin, J.\u00c9.: An explicit formula for the intersection of two polynomials of regular languages. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 31\u201345. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_5"},{"key":"20_CR11","unstructured":"Pin, J.E.: Mathematical foundations of automata theory (2020). www.irif.fr\/jep\/PDF\/MPRI\/MPRI.pdf. (in preparation)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Generic results for concatenation hierarchies. Theory Comput. Syst. (ToCS) 63(4), 849\u2013901 (2019)","DOI":"10.1007\/s00224-018-9867-0"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Going higher in first-order quantifier alternation hierarchies on words. J. ACM 66(2), 12:1\u201312:65 (2019)","DOI":"10.1145\/3303991"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Separation and covering for group based concatenation hierarchies. In: Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 1\u201313. LICS 2019 (2019)","DOI":"10.1109\/LICS.2019.8785655"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Separation for dot-depth two. Logical Methods Comput. Sci. 17(3), 1\u20134 (2021)","DOI":"10.46298\/lmcs-17(3:24)2021"},{"key":"20_CR16","unstructured":"Place, T., Zeitoun, M.: Characterizing level one in group-based concatenation hierarchies. CoRR abs\/2201.06826 (2022). https:\/\/arxiv.org\/abs\/2201.06826"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214\u2013222. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_23"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1142\/S0218196701000462","volume":"11","author":"B Steinberg","year":"2001","unstructured":"Steinberg, B.: Inevitable graphs and profinite topologies: Some solutions to algorithmic problems in monoid and automata theory, stemming from group theory. Int. J. Algebra Comput. 11(1), 25\u201372 (2001)","journal-title":"Int. J. Algebra Comput."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(81)90036-0","volume":"13","author":"H Straubing","year":"1981","unstructured":"Straubing, H.: A generalization of the sch\u00fctzenberger product of finite monoids. Theoret. Comput. Sci. 13(2), 137\u2013150 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H Straubing","year":"1985","unstructured":"Straubing, H.: Finite semigroup varieties of the form V * D. J. Pure Appl. Algebra 36, 53\u201394 (1985)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"20_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","volume":"14","author":"D Th\u00e9rien","year":"1981","unstructured":"Th\u00e9rien, D.: Classification of finite monoids: the language approach. Theoret. Comput. Sci. 14(2), 195\u2013208 (1981)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25(3), 360\u2013376 (1982)","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-031-09574-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T17:16:49Z","timestamp":1727457409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","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":"St. Petersburg","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","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":"51","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":"21","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":"41% - 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":"7","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)"}}]}}