{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:11:04Z","timestamp":1758280264163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031191343"},{"type":"electronic","value":"9783031191350"}],"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-19135-0_2","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:03:49Z","timestamp":1665529429000},"page":"28-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Post\u2019s Correspondence Problem: From Computer Science to\u00a0Algebra"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9451-1471","authenticated-orcid":false,"given":"Laura","family":"Ciobanu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Baumslag, G., Cannonito, F.B., Robinson, D.J., Segal, D.: The algorithmic theory of polycyclic-by-finite groups. J. Algebra 142(1), 118\u2013149 (1991). https:\/\/doi.org\/10.1016\/0021-8693(91)90221-S, https:\/\/doi.org\/10.1016\/0021-8693(91)90221-S","DOI":"10.1016\/0021-8693(91)90221-S 10.1016\/0021-8693(91)90221-S"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Belegradek, I., Osin, D.: Rips construction and Kazhdan property (T). Groups Geom. Dyn. 2(1), 1\u201312 (2008). https:\/\/doi.org\/10.4171\/GGD\/29, https:\/\/doi.org\/10.4171\/GGD\/29","DOI":"10.4171\/GGD\/29 10.4171\/GGD\/29"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Blackburn, N.: Conjugacy in nilpotent groups. Proc. Amer. Math. Soc. 16, 143\u2013148 (1965). https:\/\/doi.org\/10.2307\/2034018, https:\/\/doi.org\/10.2307\/2034018","DOI":"10.2307\/2034018 10.2307\/2034018"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1142\/S0218196716500028","volume":"26","author":"O Bogopolski","year":"2016","unstructured":"Bogopolski, O., Maslakova, O.: An algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group. Internat. J. Algebra Comput. 26(1), 29\u201367 (2016). https:\/\/doi.org\/10.1142\/S0218196716500028","journal-title":"Internat. J. Algebra Comput."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Ciobanu, L., Elder, M.: The complexity of solution sets to equations in hyperbolic groups. Israel J. Math. 245(2), 869\u2013920 (2021). https:\/\/doi.org\/10.1007\/s11856-021-2232-z, https:\/\/doi-org.ezproxy.st-andrews.ac.uk\/10.1007\/s11856-021-2232-z","DOI":"10.1007\/s11856-021-2232-z"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-030-81508-0_8","volume-title":"Developments in Language Theory","author":"Laura Ciobanu","year":"2021","unstructured":"Ciobanu, Laura, Logan, Alan D..: Variations on the Post correspondence problem for free groups. In: Moreira, Nelma, Reis, Rog\u00e9rio (eds.) DLT 2021. LNCS, vol. 12811, pp. 90\u2013102. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_8"},{"key":"2_CR7","unstructured":"Ciobanu, L., Martino, A., Ventura, E.: The generic Hanna Neumann Conjecture and Post Correspondence Problem (2008). http:\/\/www-eupm.upc.es\/~ventura\/ventura\/files\/31t.pdf"},{"key":"2_CR8","unstructured":"Ciobanu, L., Logan, A.D.: The post correspondence problem and equalisers for certain free group and monoid morphisms. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), pp. 120:1\u2013120:16 (2020)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Dahmani, F., Guirardel, V.: Foliations for solving equations in groups: free, virtually free, and hyperbolic groups. J. Topol. 3(2), 343\u2013404 (2010). https:\/\/doi.org\/10.1112\/jtopol\/jtq010, https:\/\/doi-org.ezproxy.st-andrews.ac.uk\/10.1112\/jtopol\/jtq010","DOI":"10.1112\/jtopol\/jtq010"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Duchin, M., Liang, H., Shapiro, M.: Equations in nilpotent groups. Proc. Amer. Math. Soc. 143(11), 4723\u20134731 (2015). https:\/\/doi.org\/10.1090\/proc\/12630, https:\/\/doi.org\/10.1090\/proc\/12630","DOI":"10.1090\/proc\/12630 10.1090\/proc\/12630"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(89)90080-7","volume":"21","author":"A Ehrenfeucht","year":"1982","unstructured":"Ehrenfeucht, A., Karhum\u00e4ki, J., Rozenberg, G.: The (generalized) Post correspondence problem with lists consisting of two words is decidable. Theoret. Comput. Sci. 21(2), 119\u2013144 (1982). https:\/\/doi.org\/10.1016\/0304-3975(89)90080-7","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.4171\/GGD\/466","volume":"12","author":"M Feighn","year":"2018","unstructured":"Feighn, M., Handel, M.: Algorithmic constructions of relative train track maps and CTs. Groups Geom. Dyn. 12(3), 1159\u20131238 (2018). https:\/\/doi.org\/10.4171\/GGD\/466","journal-title":"Groups Geom. Dyn."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Garreta, A., Miasnikov, A., Ovchinnikov, D.: Random nilpotent groups, polycyclic presentations, and Diophantine problems. Groups Complex. Cryptol. 9(2), 99\u2013115 (2017). https:\/\/doi.org\/10.1515\/gcc-2017-0007, https:\/\/doi.org\/10.1515\/gcc-2017-0007","DOI":"10.1515\/gcc-2017-0007 10.1515\/gcc-2017-0007"},{"key":"2_CR14","unstructured":"Gilman, R., Miasnikov, A.G., Myasnikov, A.D., Ushakov, A.: Report on generic case complexity (2007). https:\/\/arxiv.org\/pdf\/0707.1364v1.pdf"},{"issue":"5","key":"2_CR15","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1112\/blms\/18.5.468","volume":"18","author":"RZ Goldstein","year":"1986","unstructured":"Goldstein, R.Z., Turner, E.C.: Fixed subgroups of homomorphisms of free groups. Bull. London Math. Soc. 18(5), 468\u2013470 (1986). https:\/\/doi.org\/10.1112\/blms\/18.5.468","journal-title":"Bull. London Math. Soc."},{"issue":"1\u20132","key":"2_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0304-3975(99)00163-2","volume":"255","author":"V Halava","year":"2001","unstructured":"Halava, V., Hirvensalo, M., de Wolf, R.: Marked PCP is decidable. Theoret. Comput. Sci. 255(1\u20132), 193\u2013204 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00163-2","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Harju, T., Karhum\u00e4ki, J.: Morphisms. In: Handbook of Formal Languages, Vol. 1, pp. 439\u2013510. Springer, Berlin (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5","DOI":"10.1007\/978-3-642-59136-5"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0021-8693(03)00167-4","volume":"264","author":"I Kapovich","year":"2003","unstructured":"Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory, and random walks. J. Algebra 264(2), 665\u2013694 (2003)","journal-title":"J. Algebra"},{"issue":"4","key":"2_CR19","first-page":"9","volume":"12","author":"J Karhum\u00e4ki","year":"2010","unstructured":"Karhum\u00e4ki, J., Saarela, A.: Noneffective regularity of equality languages and bounded delay morphisms. Discrete Math. Theor. Comput. Sci. 12(4), 9\u201317 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, D., Lohrey, M.: Evaluation of circuits over nilpotent and polycyclic groups. Algorithmica 80(5), 1459\u20131492 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0343-z, https:\/\/doi-org.ezproxy.st-andrews.ac.uk\/10.1007\/s00453-017-0343-z","DOI":"10.1007\/s00453-017-0343-z"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, D., Lohrey, M., Zetzsche, G.: Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. Algebra Comput. Sci. Contemp. Math. 677, 129\u2013144. American Mathematical Society, Providence, RI (2016). https:\/\/doi.org\/10.1090\/conm\/677, https:\/\/doi-org.ezproxy.st-andrews.ac.uk\/10.1090\/conm\/677","DOI":"10.1090\/conm\/677"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Laura Ciobanu, A.D.L.: Fixed points and stable images of endomorphisms for the free group of rank two. J. Algebra 591, 538\u2013576 (2022). https:\/\/doi.org\/10.1007\/BF02095993","DOI":"10.1007\/BF02095993"},{"key":"2_CR23","first-page":"2940","volume":"257","author":"Y Lecerf","year":"1963","unstructured":"Lecerf, Y.: R\u00e9cursive insolubilit\u00e9 de l\u2019\u00e9quation g\u00e9n\u00e9rale de diagonalisation de deux monomorphismes de mono\u00efdes libres $$\\varphi x=\\psi x$$. C. R. Acad. Sci. Paris 257, 2940\u20132943 (1963)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Levine, A., Logan, A.D.: On Post\u2019s correspondence problem for hyperbolic and virtually nilpotent groups.  17, 991\u20131008, (2022, work in progress)","DOI":"10.1515\/jgth-2014-0022"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Lo, E.H.: Finding intersections and normalizers in finitely generated nilpotent groups. J. Symbolic Comput. 25(1), 45\u201359 (1998). https:\/\/doi.org\/10.1006\/jsco.1997.0166, https:\/\/doi.org\/10.1006\/jsco.1997.0166","DOI":"10.1006\/jsco.1997.0166 10.1006\/jsco.1997.0166"},{"issue":"6","key":"2_CR26","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1515\/jgth-2014-0022","volume":"17","author":"A Myasnikov","year":"2014","unstructured":"Myasnikov, A., Nikolaev, A., Ushakov, A.: The Post correspondence problem in groups. J. Group Theory 17(6), 991\u20131008 (2014)","journal-title":"J. Group Theory"},{"key":"2_CR27","first-page":"649","volume":"30","author":"T Neary","year":"2015","unstructured":"Neary, T.: Undecidability in binary tag systems and the Post correspondence problem for five pairs of words 30, 649\u2013661 (2015)","journal-title":"Undecidability in binary tag systems and the Post correspondence problem for five pairs of words"},{"key":"2_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88599-0","volume-title":"Varieties of Groups","author":"H Neumann","year":"1967","unstructured":"Neumann, H.: Varieties of Groups. Springer-Verlag, New York (1967). https:\/\/doi.org\/10.1007\/978-3-642-88599-0"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"EL Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc. 52, 264\u2013268 (1946). https:\/\/doi.org\/10.1090\/S0002-9904-1946-08555-9","journal-title":"Bull. Amer. Math. Soc."},{"issue":"2","key":"2_CR30","first-page":"201","volume":"34","author":"NN Repin","year":"1983","unstructured":"Repin, N.N.: Equations with one unknown in nilpotent groups. Mat. Zametki 34(2), 201\u2013206 (1983)","journal-title":"Mat. Zametki"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Rips, E.: Subgroups of small cancellation groups. Bull. London Math. Soc. 14(1), 45\u201347 (1982). https:\/\/doi.org\/10.1112\/blms\/14.1.45, https:\/\/doi-org.ezproxy.st-andrews.ac.uk\/10.1112\/blms\/14.1.45","DOI":"10.1112\/blms\/14.1.45"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Roman\u2019kov, V.A.: Unsolvability of the problem of endomorphic reducibility in free nilpotent groups and in free rings. Algebra i Logika 16(4), 457\u2013471, 494 (1977)","DOI":"10.1007\/BF01669283"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Roman\u2019kov, V.A.: Diophantine questions in the class of finitely generated nilpotent groups. J. Group Theory 19(3), 497\u2013514 (2016). https:\/\/doi.org\/10.1515\/jgth-2016-0504, https:\/\/doi.org\/10.1515\/jgth-2016-0504","DOI":"10.1515\/jgth-2016-0504 10.1515\/jgth-2016-0504"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Stallings, J.R.: Graphical theory of automorphisms of free groups. In: Combinatorial Group Theory and Topology (Alta, Utah, 1984), Annals of Mathematics Studies, vol. 111, pp. 79\u2013105. Princeton University Press, Princeton (1987). https:\/\/doi.org\/10.1007\/978-1-4612-4372-4","DOI":"10.1007\/978-1-4612-4372-4"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19135-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:09:18Z","timestamp":1665529758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19135-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031191343","9783031191350"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19135-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaiserslautern","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2022.mpi-sws.org\/","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":"14","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":"8","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":"57% - 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":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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited talks are also included.","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)"}}]}}