{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:52:54Z","timestamp":1743151974088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_3","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"29-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Computational Power of Programs over $$\\mathsf {BA}_2$$ Monoid"],"prefix":"10.1007","author":[{"given":"Manasi S.","family":"Kulkarni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janani","family":"Sundaresan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D Barrington","year":"1990","unstructured":"Barrington, D., Straubing, H., Th\u00e9rien, D.: Non-uniform automata over groups. Inf. Comput. 89(2), 109\u2013132 (1990). Preliminary version appeared in ICALP 1987","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"DA Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC$$^1$$. J. Comput. Syst. Sci. 38(1), 150\u2013164 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"DAM Barrington","year":"1988","unstructured":"Barrington, D.A.M., Th\u00e9rien, D.: Finite monoids and the fine structure of NC$$^1$$. J. ACM 35(4), 941\u2013952 (1988)","journal-title":"J. ACM"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1145\/146637.146661","volume":"39","author":"M Beaudry","year":"1992","unstructured":"Beaudry, M., McKenzie, P., Th\u00e9rien, D.: The membership problem in aperiodic transformation monoids. J. ACM 39(3), 599\u2013616 (1992)","journal-title":"J. ACM"},{"key":"3_CR5","unstructured":"Eilenberg, S.: Automata, Languages, and Machines Vol A and B. Academic press (1974)"},{"key":"3_CR6","unstructured":"Grosshans, N., McKenzie, P., Segoufin, L.: The power of programs over monoids in DA. In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), vol. 83, pp. 2:1\u20132:20 (2017)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1090\/S0002-9947-1965-0188316-1","volume":"116","author":"K Krohn","year":"1965","unstructured":"Krohn, K., Rhodes, J.: Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Am. Math. Soc. 116, 450\u2013464 (1965)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"3_CR8","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. Theor. Comput. Sci. 245(1), 135\u2013148 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1090\/S0002-9939-1965-0175971-0","volume":"16","author":"WD Maurer","year":"1965","unstructured":"Maurer, W.D., Rhodes, J.L.: A property of finite simple non-Abelian groups. Proc. Am. Math. Soc. 16(3), 552\u2013554 (1965)","journal-title":"Proc. Am. Math. Soc."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF01212963","volume":"1","author":"P McKenzie","year":"1991","unstructured":"McKenzie, P., P\u00e9ladeau, P., Th\u00e9rien, D.: NC$$^1$$: the automata-theoretic viewpoint. Comput. Complex. 1, 330\u2013359 (1991)","journal-title":"Comput. Complex."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Pin, J.E., Miller, R.E.: Varieties of Formal Languages. Plenum Publishing Co. (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0304-3975(96)00297-6","volume":"180","author":"P P\u00e9ladeau","year":"1997","unstructured":"P\u00e9ladeau, P., Straubing, H., Therien, D.: Finite semigroup varieties defined by programs. Theor. Comput. Sci. 180(1), 325\u2013339 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR13","unstructured":"Tesson, P.: Computational Complexity Questions Related to Finite Monoids and Semigroups. Ph.D. thesis, McGill University (2003)"},{"issue":"2","key":"3_CR14","first-page":"247","volume":"7","author":"P Tesson","year":"2001","unstructured":"Tesson, P., Th\u00e9rien, D.: The computing power of programs over finite monoids. J. Autom. Lang. Comb. 7(2), 247\u2013258 (2001)","journal-title":"J. Autom. Lang. Comb."}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:11:49Z","timestamp":1613952709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_3","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)"}}]}}