{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:14:14Z","timestamp":1743034454797,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031661587"},{"type":"electronic","value":"9783031661594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_4","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"37-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deciding Conjugacy of\u00a0a\u00a0Rational Relation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4878-7581","authenticated-orcid":false,"given":"C.","family":"Aiswarya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4953-7920","authenticated-orcid":false,"given":"Amaldev","family":"Manuel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1366-0168","authenticated-orcid":false,"given":"Saina","family":"Sunny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Aiswarya, C., Manuel, A., Sunny, S.: Deciding conjugacy of a rational relation. CoRR abs\/2307.06777 (2023). https:\/\/doi.org\/10.48550\/arXiv.2307.06777","DOI":"10.48550\/arXiv.2307.06777"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Aiswarya, C., Manuel, A., Sunny, S.: Edit distance of finite state transducers. In: Bringmann, K., Grohe, M., Puppis, G., Svensson, O. (eds.) 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol. 297, pp. 125:1\u2013125:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\"ur Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2024.125. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ICALP.2024.125. ISBN 978-3-95977-322-5. ISSN 1868-8969","DOI":"10.4230\/LIPIcs.ICALP.2024.125"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bojanczyk, M.: Transducers of polynomial growth. In: LICS 2022, pp. 1\u201327. ACM (2022). https:\/\/doi.org\/10.1145\/3531130.3533326","DOI":"10.1145\/3531130.3533326"},{"issue":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1051\/ita:2001130","volume":"35","author":"J Cassaigne","year":"2001","unstructured":"Cassaigne, J., Karhum\u00e4ki, J., Manuch, J.: On conjugacy of languages. RAIRO Theor. Inform. Appl. 35(6), 535\u2013550 (2001). https:\/\/doi.org\/10.1051\/ita:2001130","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C Choffrut","year":"1977","unstructured":"Choffrut, C.: Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationnelles. Theor. Comput. Sci. 5(3), 325\u2013337 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90049-4","journal-title":"Theor. Comput. Sci."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 329\u2013438. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_6"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-16078-7_78","volume-title":"STACS 86","author":"C Choffrut","year":"1986","unstructured":"Choffrut, C., Schutzenberger, M.P.: Decomposition de fonctions rationnelles. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol. 210, pp. 213\u2013226. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16078-7_78"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Colcombet, T.: The factorisation forest theorem. In: Handbook of Automata Theory, pp. 653\u2013693. European Mathematical Society Publishing House (2021). https:\/\/doi.org\/10.4171\/AUTOMATA-1\/18","DOI":"10.4171\/AUTOMATA-1\/18"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216\u2013254 (2001). https:\/\/doi.org\/10.1145\/371316.371512","journal-title":"ACM Trans. Comput. Log."},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Finkel, O., Halava, V., Harju, T., Sahla, E.: On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Inform. Appl. 57, 7 (2023). https:\/\/doi.org\/10.1051\/ITA\/2023008","DOI":"10.1051\/ITA\/2023008"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1142\/S0129054118400075","volume":"29","author":"I Jecker","year":"2018","unstructured":"Jecker, I., Filiot, E.: Multi-sequential word relations. Int. J. Found. Comput. Sci. 29(2), 271\u2013296 (2018). https:\/\/doi.org\/10.1142\/S0129054118400075","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-45132-3_4","volume-title":"Machines, Computations, and Universality","author":"J Karhum\u00e4ki","year":"2001","unstructured":"Karhum\u00e4ki, J.: Combinatorial and computational problems on finite sets of words. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 69\u201381. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45132-3_4"},{"issue":"1\u20132","key":"4_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/J.TCS.2006.01.028","volume":"356","author":"S Lombardy","year":"2006","unstructured":"Lombardy, S., Sakarovitch, J.: Sequential? Theor. Comput. Sci. 356(1\u20132), 224\u2013244 (2006). https:\/\/doi.org\/10.1016\/J.TCS.2006.01.028","journal-title":"Theor. Comput. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library, Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/CBO9780511566097","DOI":"10.1017\/CBO9780511566097"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.4169\/amer.math.monthly.122.03.217","volume":"122","author":"D Peifer","year":"2015","unstructured":"Peifer, D.: Max Dehn and the origins of topology and infinite group theory. Am. Math. Mon. 122(3), 217\u2013233 (2015). https:\/\/doi.org\/10.4169\/amer.math.monthly.122.03.217","journal-title":"Am. Math. Mon."},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9781139195218","DOI":"10.1017\/CBO9781139195218"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theor. Comput. Sci. 72(1), 65\u201394 (1990). https:\/\/doi.org\/10.1016\/0304-3975(90)90047-L","journal-title":"Theor. Comput. Sci."}],"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-66159-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:02:49Z","timestamp":1729324969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_4"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","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":"G\u00f6ttingen","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}