{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:01:48Z","timestamp":1758279708084,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030248857"},{"type":"electronic","value":"9783030248864"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24886-4_22","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:02:56Z","timestamp":1563908576000},"page":"292-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Context-Free Word Problem Semigroups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3576-0670","authenticated-orcid":false,"given":"Tara","family":"Brough","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0706-1354","authenticated-orcid":false,"given":"Alan J.","family":"Cain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9881-4429","authenticated-orcid":false,"given":"Markus","family":"Pfeiffer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"22_CR1","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String Rewriting Systems","author":"RV Book","year":"1993","unstructured":"Book, R.V., Otto, F.: String Rewriting Systems. Texts and Monographs in Computer Science. Springer, New York (1993). \n                      https:\/\/doi.org\/10.1007\/978-1-4613-9771-7"},{"issue":"1","key":"22_CR2","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). \n                      https:\/\/doi.org\/10.1515\/gcc-2014-0002","journal-title":"Groups Complex. Cryptol."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-94631-3_3","volume-title":"Descriptional Complexity of Formal Systems","author":"T Brough","year":"2018","unstructured":"Brough, T.: Word problem languages for free inverse monoids. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 24\u201336. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-94631-3_3"},{"key":"22_CR4","unstructured":"Brough, T., Cain, A.J.: A language hierarchy of binary relations (2018)"},{"key":"22_CR5","unstructured":"Brough, T.R.: Groups with poly-context-free word problem. Ph.D. thesis, University of Warwick (2010). \n                      https:\/\/wrap.warwick.ac.uk\/35716\/"},{"issue":"07","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1250061","DOI":"10.1142\/S0218196712500610","volume":"22","author":"ALAN J. CAIN","year":"2012","unstructured":"Cain, A.J., Maltcev, V.: Context-free rewriting systems and word-hyperbolic structures with uniqueness. Int. J. Algebra Comput. 22(7) (2012). \n                      https:\/\/doi.org\/10.1142\/S0218196712500610","journal-title":"International Journal of Algebra and Computation"},{"issue":"1\u20132","key":"22_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(99)00151-6","volume":"250","author":"CM Campbell","year":"2001","unstructured":"Campbell, C.M., Robertson, E.F., Ru\u0161kuc, N., Thomas, R.M.: Automatic semigroups. Theor. Comput. Sci. 250(1\u20132), 365\u2013391 (2001). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(99)00151-6","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1017\/S0305004103007497","volume":"136","author":"A Duncan","year":"1999","unstructured":"Duncan, A., Gilman, R.H.: Word hyperbolic semigroups. Math. Proc. Camb. Philos. Soc. 136(3), 513\u2013524 (1999). \n                      https:\/\/doi.org\/10.1017\/S0305004103007497","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"3","key":"22_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). \n                      https:\/\/doi.org\/10.1007\/BF01388581","journal-title":"Invent. Math."},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"DBA Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones & Bartlett, Boston (1992)"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s002090100356","volume":"242","author":"RH Gilman","year":"2002","unstructured":"Gilman, R.H.: On the definition of word hyperbolic groups. Math. Z. 242(3), 529\u2013541 (2002). \n                      https:\/\/doi.org\/10.1007\/s002090100356","journal-title":"Math. Z."},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Greibach, S.: Deterministic context free languages. Inf. Control 9(6), 620\u2013648 (1966). \n                      https:\/\/doi.org\/10.1016\/S0019-9958(66)80019-0","journal-title":"Inf. Control"},{"key":"22_CR13","series-title":"Mathematical Sciences Research Institute Publications","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-1-4613-9586-7_3","volume-title":"Essays in Group Theory","author":"M Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in Group Theory. Mathematical Sciences Research Institute Publications, vol. 8, pp. 75\u2013263. Springer, New York (1987). \n                      https:\/\/doi.org\/10.1007\/978-1-4613-9586-7_3"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(93)90018-O","volume":"112","author":"T Herbst","year":"1993","unstructured":"Herbst, T., Thomas, R.M.: Group presentations, formal languages and characterizations of one-counter groups. Theor. Comput. Sci. 112(2), 187\u2013213 (1993). \n                      https:\/\/doi.org\/10.1016\/0304-3975(93)90018-O","journal-title":"Theor. Comput. Sci."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-31653-1_10","volume-title":"Developments in Language Theory","author":"M Hoffmann","year":"2012","unstructured":"Hoffmann, M., Holt, D.F., Owens, M.D., Thomas, R.M.: Semigroups with a context-free word problem. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 97\u2013108. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31653-1_10"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Hoffmann, M., Kuske, D., Otto, F., Thomas, R.M.: Some relatives of automatic and hyperbolic groups. In: Gomes, G.M.S., Pin, J.\u00c9., Silva, P.V. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 379\u2013406. World Scientific, River Edge (2002). \n                      https:\/\/doi.org\/10.1142\/9789812776884_0016","DOI":"10.1142\/9789812776884_0016"},{"issue":"02","key":"22_CR17","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(02), 197 (2008). \n                      https:\/\/doi.org\/10.1017\/S1446788708000864","journal-title":"J. Aust. Math. Soc."},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1112\/S002461070500654X","volume":"71","author":"DF Holt","year":"1999","unstructured":"Holt, D.F., Rees, S., R\u00f6ver, C.E., Thomas, R.M.: Groups with context-free co-word problem. J. London Math. Soc. 71(3), 643\u2013657 (1999). \n                      https:\/\/doi.org\/10.1112\/S002461070500654X","journal-title":"J. London Math. Soc."},{"issue":"5","key":"22_CR19","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). \n                      https:\/\/doi.org\/10.1142\/S0218196706003359","journal-title":"Int. J. Algebra Comput."},{"key":"22_CR20","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 1st edn. Addison-Wesley, Reading (1979)","edition":"1"},{"key":"22_CR21","unstructured":"Howie, J.M.: Fundamentals of Semigroup Theory. London Mathematical Society Monographs: New Series, vol. 12. Clarendon Press, Oxford University Press, New York (1995)"},{"issue":"3","key":"22_CR22","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). \n                      https:\/\/doi.org\/10.1016\/0022-0000(83)90003-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"07","key":"22_CR23","doi-asserted-by":"publisher","first-page":"2665","DOI":"10.1090\/S0002-9947-98-02074-1","volume":"350","author":"EF Robertson","year":"1998","unstructured":"Robertson, E.F., Ru\u0161kuc, N., Wiegold, J.: Generators and relations of direct products of semigroups. Trans. Am. Math. Soc. 350(07), 2665\u20132686 (1998). \n                      https:\/\/doi.org\/10.1090\/S0002-9947-98-02074-1","journal-title":"Trans. Am. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24886-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:05:03Z","timestamp":1563908703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","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":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"30","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":"20","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":"67% - 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":"2","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)"}}]}}