{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:50:11Z","timestamp":1756191011201},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T00:00:00Z","timestamp":1240272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00200-009-0097-1","type":"journal-article","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T11:09:56Z","timestamp":1240225796000},"page":"187-205","source":"Crossref","is-referenced-by-count":4,"title":["Undecidable properties of flat term rewrite systems"],"prefix":"10.1007","volume":"20","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,21]]},"reference":[{"key":"97_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader F., Nipkow T.: Term Rewriting and All That. Cambridge University Press, New York (1998)"},{"key":"97_CR2","doi-asserted-by":"crossref","unstructured":"Godoy, G., Huntingford, E., Tiwari, A.: Termination of rewriting with right-flat rules. In: Baader, F. (ed.) Term Rewriting and Applications, 18th International Conference, RTA, LNCS, vol. 4533, pp. 200\u2013213. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73449-9_16"},{"key":"97_CR3","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tison, S.: On the normalization and unique normalization properties of term rewrite systems. In: Pfenning, F. (ed.) Proceedings of the 21st International Conference on Automated Deduction (CADE-21), LNCS, vol. 4603, pp. 247\u2013262 (2007)","DOI":"10.1007\/978-3-540-73595-3_17"},{"key":"97_CR4","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(ground or variable) rewrite systems by rewrite closure. In: Basin, D., Rusinowitch, M. (eds.) International Joint Conference on Automated Deduction, IJCAR, LNAI, vol. 3097, pp. 91\u2013106. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-25984-8_5"},{"key":"97_CR5","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, C.H.L. (ed.) 19th International Workshop of Computer Science Logic, CSL, LNCS, vol. 3634, pp. 541\u2013556. Springer, Heidelberg (2005)","DOI":"10.1007\/11538363_37"},{"key":"97_CR6","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tiwari, A., Verma, R.: On the confluence of linear shallow term rewrite systems. In: Alt, H., Habib, M. (eds.) 20th International Symposium on Theoretical Aspects of Computer Science STACS 2003, Lecture Notes in Computer Science, vol. 2607, pp. 85\u201396. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36494-3_9"},{"issue":"5","key":"97_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0020-0190(03)00310-7","volume":"87","author":"F. Jacquemard","year":"2003","unstructured":"Jacquemard F.: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5), 265\u2013270 (2003)","journal-title":"Inf. Process. Lett."},{"key":"97_CR8","doi-asserted-by":"crossref","unstructured":"Mitsuhashi, I., Oyamaguchi, M., Jacquemard, F.: The confluence problem for flat TRSs. In: Proceedings of 8th International Conference on Artificial Intelligence and Symbolic Computation (AISC\u201906), LNAI, vol. 4120, pp. 68\u201381. Springer, Heidelberg (2006)","DOI":"10.1007\/11856290_8"},{"issue":"2","key":"97_CR9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1006\/inco.2002.3157","volume":"178","author":"T. Nagaya","year":"2002","unstructured":"Nagaya T., Toyama Y.: Decidability for left-linear growing term rewriting systems. Inf. Comput. 178(2), 499\u2013514 (2002)","journal-title":"Inf. Comput."},{"key":"97_CR10","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Course Technology (2006)"},{"key":"97_CR11","doi-asserted-by":"crossref","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Rewriting Techniques and Applications, RTA, LNCS, vol. 1833, pp. 246\u2013260 (2000)","DOI":"10.1007\/10721975_17"},{"issue":"1","key":"97_CR12","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/1042038.1042042","volume":"6","author":"R. Verma","year":"2005","unstructured":"Verma R., Hayrapetyan A.: A new decidability technique for ground term rewriting systems. ACM Trans. Comput. Log. 6(1), 102\u2013123 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"97_CR13","doi-asserted-by":"crossref","unstructured":"Wang, Y., Sakai, M.: Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In: Proceedings of the 17th International Conference of RTA, LNCS, vol. 4098, pp. 343\u2013356. Springer, Heidelberg (2006)","DOI":"10.1007\/11805618_26"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-009-0097-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-009-0097-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-009-0097-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:24:21Z","timestamp":1558625061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-009-0097-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,21]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s00200-009-0097-1","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,21]]}}}