Florent Jacquemard Reachability and confluence are undecidable for flat term rewriting systems. 265-270 2003 87 Inf. Process. Lett. 5 https://doi.org/10.1016/S0020-0190(03)00310-7 db/journals/ipl/ipl87.html#Jacquemard03