Reachability and confluence are undecidable for flat term rewriting systems

Florent Jacquemard. Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett., 87(5):265-270, 2003. [doi]

Abstract

Abstract is missing.