Reachability and confluence are undecidable for flat term rewriting systems
Résumé
Ground reachability, ground joinability and confluence are shown undecidable for flat term rewriting systems, i.e. systems in which all left and right members of rule have depth at most one.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...