{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:23:18Z","timestamp":1743157398407,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030815073"},{"type":"electronic","value":"9783030815080"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-81508-0_8","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"90-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Variations on the Post Correspondence Problem for Free Groups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9451-1471","authenticated-orcid":false,"given":"Laura","family":"Ciobanu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1767-6798","authenticated-orcid":false,"given":"Alan D.","family":"Logan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"8_CR1","unstructured":"Bartholdi, L., Silva, P.V.: Rational subsets of groups. arXiv:1012.1532 (2010)"},{"issue":"1","key":"8_CR2","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. Int. J. Algebra Comput. 26(1), 29\u201367 (2016)","journal-title":"Int. J. Algebra Comput."},{"key":"8_CR3","unstructured":"Ciobanu, L., Logan, A.: Fixed points and stable images of endomorphisms for the free group of rank two. arXiv:2009.04937 (2020)"},{"key":"8_CR4","unstructured":"Ciobanu, L., Logan, A.: 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":"8_CR5","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":"8_CR6","unstructured":"Diekert, V., Kharlampovich, O., Lohrey, M., Myasnikov, A.: Algorithmic problems in group theory. Dagstuhl seminar report 19131 (2019). https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11293\/pdf\/dagrep_v009_i003_p083_19131.pdf"},{"issue":"2","key":"8_CR7","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)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR8","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)","journal-title":"Groups Geom. Dyn."},{"key":"8_CR9","unstructured":"Gilman, R., Miasnikov, A.G., Myasnikov, A.D., Ushakov, A.: Report on generic case complexity. arXiv:0707.1364v1 (2007)"},{"issue":"5","key":"8_CR10","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)","journal-title":"Bull. London Math. Soc."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-59136-5_7","volume-title":"Handbook of Formal Languages","author":"T Harju","year":"1997","unstructured":"Harju, T., Karhum\u00e4ki, J.: Morphisms. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 439\u2013510. Springer, Heidelberg (1997)"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1006\/jabr.2001.9033","volume":"248","author":"I Kapovich","year":"2002","unstructured":"Kapovich, I., Myasnikov, A.: Stallings foldings and subgroups of free groups. J. Algebra 248(2), 608\u2013668 (2002)","journal-title":"J. Algebra"},{"issue":"2","key":"8_CR13","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":"8_CR14","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. Theoret. Comput. Sci. 12(4), 9\u201317 (2010)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"8_CR15","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":"8_CR16","unstructured":"Martino, A., Turner, E., Ventura, E.: The density of injective endomorphisms of a free group (2006). http:\/\/www-eupm.upc.es\/~ventura\/ventura\/files\/23t.pdf"},{"issue":"6","key":"8_CR17","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":"8_CR18","unstructured":"Neary, T.: Undecidability in binary tag systems and the post correspondence problem for five pairs of words. In: 32nd International Symposium on Theoretical Aspects of Computer Science, LIPIcs. Leibniz International Proceedings in Informatics, vol. 30, pp. 649\u2013661. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2015)"},{"key":"8_CR19","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. Am. Math. Soc. 52, 264\u2013268 (1946)","journal-title":"Bull. Am. Math. Soc."}],"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-030-81508-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:33:02Z","timestamp":1628206382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_8","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":"6 August 2021","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":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt2021.dcc.fc.up.pt\/","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":"48","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":"27","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":"56% - 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)"}}]}}