{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:46:18Z","timestamp":1743140778973,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_20","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"246-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Groups Whose Word Problems Are Accepted by\u00a0Abelian $$G$$-Automata"],"prefix":"10.1007","author":[{"given":"Takao","family":"Yuyama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"20_CR1","first-page":"4","volume":"2","author":"AV An\u012bs\u012bmov","year":"1972","unstructured":"An\u012bs\u012bmov, A.V.: Certain algorithmic questions for groups and context-free languages. Kibernetika (Kiev) 2, 4\u201311 (1972)","journal-title":"Kibernetika (Kiev)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Boone, W.W., Higman, G.: An algebraic characterization of groups with soluble word problem. J. Aust. Math. Soc. 18, 41\u201353 (1974). Collection of articles dedicated to the memory of Hanna Neumann, IX","DOI":"10.1017\/S1446788700019108"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1515\/gcc-2014-0002","volume":"6","author":"T Brough","year":"2014","unstructured":"Brough, T.: Groups with poly-context-free word problem. Groups Complex. Cryptol. 6(1), 9\u201329 (2014). https:\/\/doi.org\/10.1515\/gcc-2014-0002","journal-title":"Groups Complex. Cryptol."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2015.06.054","volume":"600","author":"T Ceccherini-Silberstein","year":"2015","unstructured":"Ceccherini-Silberstein, T., Coornaert, M., Fiorenzi, F., Schupp, P.E., Touikan, N.W.M.: Multipass automata and group word problems. Theor. Comput. Sci. 600, 19\u201333 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.06.054","journal-title":"Theor. Comput. Sci."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"20_CR6","unstructured":"Cleary, S., Elder, M., Ostheimer, G.: The word problem distinguishes counter languages (2006). https:\/\/arxiv.org\/abs\/math\/0606415"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1142\/S0218196705002360","volume":"15","author":"JM Corson","year":"2005","unstructured":"Corson, J.M.: Extended finite automata and word problems. Int. J. Algebra Comput. 15(3), 455\u2013466 (2005). https:\/\/doi.org\/10.1142\/S0218196705002360","journal-title":"Int. J. Algebra Comput."},{"issue":"6","key":"20_CR8","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1142\/S0218196700000315","volume":"10","author":"J Dassow","year":"2000","unstructured":"Dassow, J., Mitrana, V.: Finite automata over free groups. Int. J. Algebra Comput. 10(6), 725\u2013737 (2000). https:\/\/doi.org\/10.1142\/S0218196700000315","journal-title":"Int. J. Algebra Comput."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01388581","volume":"81","author":"MJ Dunwoody","year":"1985","unstructured":"Dunwoody, M.J.: The accessibility of finitely presented groups. Invent. Math. 81(3), 449\u2013457 (1985). https:\/\/doi.org\/10.1007\/BF01388581","journal-title":"Invent. Math."},{"issue":"8","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1142\/S0218196708004901","volume":"18","author":"M Elder","year":"2008","unstructured":"Elder, M., Kambites, M., Ostheimer, G.: On groups and counter automata. Int. J. Algebra Comput. 18(8), 1345\u20131364 (2008). https:\/\/doi.org\/10.1142\/S0218196708004901","journal-title":"Int. J. Algebra Comput."},{"issue":"2\u20133","key":"20_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2003.09.007","volume":"320","author":"GZ Elston","year":"2004","unstructured":"Elston, G.Z., Ostheimer, G.: On groups whose word problem is solved by a counter automaton. Theor. Comput. Sci. 320(2\u20133), 175\u2013185 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.09.007","journal-title":"Theor. Comput. Sci."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jcss.2022.02.003","volume":"127","author":"K Gebhardt","year":"2022","unstructured":"Gebhardt, K., Meunier, F., Salvati, S.: $$O_n$$ is an $$n$$-MCFL. J. Comput. Syst. Sci. 127, 41\u201352 (2022). https:\/\/doi.org\/10.1016\/j.jcss.2022.02.003","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1515\/gcc-2018-0010","volume":"10","author":"RH Gilman","year":"2018","unstructured":"Gilman, R.H., Kropholler, R.P., Schleimer, S.: Groups whose word problems are not semilinear. Groups Complex. Cryptol. 10(2), 53\u201362 (2018). https:\/\/doi.org\/10.1515\/gcc-2018-0010","journal-title":"Groups Complex. Cryptol."},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Greibach, S.A.: Remarks on the complexity of nondeterministic counter languages. Theor. Comput. Sci. 1(4), 269\u2013288 (1975\/76). https:\/\/doi.org\/10.1016\/0304-3975(76)90072-4","DOI":"10.1016\/0304-3975(76)90072-4"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"SA Greibach","year":"1978","unstructured":"Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7(3), 311\u2013324 (1978). https:\/\/doi.org\/10.1016\/0304-3975(78)90020-8","journal-title":"Theor. Comput. Sci."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Gromov, M.: Groups of polynomial growth and expanding maps. Inst. Hautes \u00c9tudes Sci. Publ. Math. (53), 53\u201373 (1981). https:\/\/www.numdam.org\/item?id=PMIHES_1981__53__53_0","DOI":"10.1007\/BF02698687"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1098\/rspa.1961.0132","volume":"262","author":"G Higman","year":"1961","unstructured":"Higman, G.: Subgroups of finitely presented groups. Proc. Roy. Soc. Lond. Ser. A 262, 455\u2013475 (1961). https:\/\/doi.org\/10.1098\/rspa.1961.0132","journal-title":"Proc. Roy. Soc. Lond. Ser. A"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 3(1), 326\u2013336 (1952). https:\/\/doi.org\/10.1112\/plms\/s3-2.1.326","journal-title":"Proc. Lond. Math. Soc."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/S1446788708000864","volume":"85","author":"DF Holt","year":"2008","unstructured":"Holt, D.F., Owens, M.D., Thomas, R.M.: Groups and semigroups with a one-counter word problem. J. Aust. Math. Soc. 85(2), 197\u2013209 (2008). https:\/\/doi.org\/10.1017\/S1446788708000864","journal-title":"J. Aust. Math. Soc."},{"issue":"3","key":"20_CR20","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1112\/S002461070500654X","volume":"71","author":"DF Holt","year":"2005","unstructured":"Holt, D.F., Rees, S., R\u00f6ver, C.E., Thomas, R.M.: Groups with context-free co-word problem. J. Lond. Math. Soc. 71(3), 643\u2013657 (2005). https:\/\/doi.org\/10.1112\/S002461070500654X","journal-title":"J. Lond. Math. Soc."},{"issue":"5","key":"20_CR21","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1142\/S0218196706003359","volume":"16","author":"DF Holt","year":"2006","unstructured":"Holt, D.F., R\u00f6ver, C.E.: Groups with indexed co-word problem. Int. J. Algebra Comput. 16(5), 985\u20131014 (2006). https:\/\/doi.org\/10.1142\/S0218196706003359","journal-title":"Int. J. Algebra Comput."},{"issue":"1\u20133","key":"20_CR22","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.tcs.2006.06.026","volume":"362","author":"M Kambites","year":"2006","unstructured":"Kambites, M.: Word problems recognisable by deterministic blind monoid automata. Theor. Comput. Sci. 362(1\u20133), 232\u2013237 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.06.026","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/00927870802243580","volume":"37","author":"M Kambites","year":"2009","unstructured":"Kambites, M.: Formal languages and groups as memory. Commun. Algebra 37(1), 193\u2013208 (2009). https:\/\/doi.org\/10.1080\/00927870802243580","journal-title":"Commun. Algebra"},{"key":"20_CR24","unstructured":"Kanazawa, M., Salvati, S.: MIX is not a tree-adjoining language. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Jeju Island, Korea, pp. 666\u2013674. Association for Computational Linguistics, July 2012. https:\/\/clanthology.org\/P12-1070"},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/gcc-2019-2004","volume":"11","author":"RP Kropholler","year":"2019","unstructured":"Kropholler, R.P., Spriano, D.: Closure properties in the class of multiple context-free groups. Groups Complex. Cryptol. 11(1), 1\u201315 (2019). https:\/\/doi.org\/10.1515\/gcc-2019-2004","journal-title":"Groups Complex. Cryptol."},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0166-218X(00)00200-6","volume":"108","author":"V Mitrana","year":"2001","unstructured":"Mitrana, V., Stiebe, R.: Extended finite automata over groups. Discrete Appl. Math. 108(3), 287\u2013300 (2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00200-6","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"20_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","volume":"26","author":"DE Muller","year":"1983","unstructured":"Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J. Comput. Syst. Sci. 26(3), 295\u2013310 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90003-X","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-19225-3_21","volume-title":"Descriptional Complexity of Formal Systems","author":"GA Rino Nesin","year":"2015","unstructured":"Rino Nesin, G.A., Thomas, R.M.: Groups whose word problem is a Petri net language. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 243\u2013255. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_21"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1112\/jlms\/s1-29.2.236","volume":"29","author":"BH Neumann","year":"1954","unstructured":"Neumann, B.H.: Groups covered by permutable subsets. J. Lond. Math. Soc. 29, 236\u2013248 (1954). https:\/\/doi.org\/10.1112\/jlms\/s1-29.2.236","journal-title":"J. Lond. Math. Soc."},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jalgebra.2023.02.007","volume":"622","author":"CF Nyberg-Brodda","year":"2023","unstructured":"Nyberg-Brodda, C.F.: On the word problem for free products of semigroups and monoids. J. Algebra 622, 721\u2013741 (2023). https:\/\/doi.org\/10.1016\/j.jalgebra.2023.02.007","journal-title":"J. Algebra"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-540-88282-4_42","volume-title":"Language and Automata Theory and Applications","author":"E Render","year":"2008","unstructured":"Render, E., Kambites, M.: Polycyclic and bicyclic valence automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 464\u2013475. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_42"},{"key":"20_CR32","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8594-1","volume-title":"A Course in the Theory of Groups","author":"DJS Robinson","year":"1996","unstructured":"Robinson, D.J.S.: A Course in the Theory of Groups. Graduate Texts in Mathematics, vol. 80, 2nd edn. Springer, New York (1996). https:\/\/doi.org\/10.1007\/978-1-4419-8594-1","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:06:20Z","timestamp":1684397180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"59% - 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":"6","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)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}