{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:03:05Z","timestamp":1751774585808,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944173"},{"type":"electronic","value":"9783319944180"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94418-0_25","type":"book-chapter","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T16:38:26Z","timestamp":1530722306000},"page":"244-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decidable and Undecidable Fragments of First-Order Concatenation Theory"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juvenal","family":"Murwanashyaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02017493","volume":"26","author":"J. Richard B\u00fcchi","year":"1987","unstructured":"B\u00fcchi, J.R., Senger, S.: Coding in the existential theory of concatenation. Arch. Math. Logik 26, 101\u2013106 (1986)","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"25_CR2","unstructured":"Day, J., Ganesh, V., He, P., Manea, F., Nowotka, D.: The satisfiability of extended word equations: the boundary between decidability and undecidability. arXiv:1802.00523 (2018)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-39611-3_21","volume-title":"Hardware and Software: Verification and Testing","author":"V Ganesh","year":"2013","unstructured":"Ganesh, V., Minnes, M., Solar-Lezama, A., Rinard, M.: Word equations with length constraints: what\u2019s decidable? In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, pp. 209\u2013226. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39611-3_21"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s11225-005-2976-1","volume":"79","author":"A Grzegorczyk","year":"2005","unstructured":"Grzegorczyk, A.: Undecidability without arithmetization. Stud. Logica. 79, 163\u2013230 (2005)","journal-title":"Stud. Logica."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Grzegorczyk, A., Zdanowski, K.: Undecidability and concatenation. In: Ehrenfeucht, A., et al. (eds.) Andrzej Mostowski and Foundational Studies, pp. 72\u201391. IOS, Amsterdam (2008)","DOI":"10.3233\/978-1-58603-782-6-72"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Halfon, S., Schnoebelen, P., Zetzsche, G.: Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: Proceedings of LICS 2017, pp. 1\u201312. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005141"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1215\/00294527-1715698","volume":"53","author":"Y Horihata","year":"2012","unstructured":"Horihata, Y.: Weak theories of concatenation and arithmetic. Notre Dame J. Formal Log. 53, 203\u2013222 (2012)","journal-title":"Notre Dame J. Formal Log."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/337244.337255","volume":"47","author":"J Karhum\u00e4ki","year":"2000","unstructured":"Karhum\u00e4ki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. J. ACM 47, 483\u2013505 (2000)","journal-title":"J. ACM"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Kristiansen, L., Murwanashyaka, J.: Notes on fragments of first-order concatenation theory. arXiv:1804.06367 (2018)","DOI":"10.1007\/978-3-319-94418-0_25"},{"key":"25_CR10","unstructured":"Leary, C., Kristiansen, L.: A Friendly Introduction to Mathematical Logic, 2nd edn. Milne Library, SUNY Geneseo, Geneseo (2015)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"GS Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR-Sbornik 32, 129\u2013198 (1977)","journal-title":"Math. USSR-Sbornik"},{"key":"25_CR12","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."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1215\/00294527-2008-028","volume":"50","author":"A Visser","year":"2009","unstructured":"Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre Dame J. Formal Log. 50, 61\u201385 (2009)","journal-title":"Notre Dame J. Formal Log."}],"container-title":["Lecture Notes in Computer Science","Sailing Routes in the World of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94418-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T15:26:57Z","timestamp":1751729217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94418-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944173","9783319944180"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94418-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}