"Reachability and confluence are undecidable for flat term rewriting systems."

Florent Jacquemard (2003)

Details and statistics

DOI: 10.1016/S0020-0190(03)00310-7

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics