Reachability and confluence are undecidable for flat term rewriting systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information Processing Letters Year : 2003

Reachability and confluence are undecidable for flat term rewriting systems

Florent Jacquemard

Abstract

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.
Fichier principal
Vignette du fichier
jacquemard-IPL-HAL.pdf (110.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00578875 , version 1 (22-03-2011)

Identifiers

  • HAL Id : inria-00578875 , version 1

Cite

Florent Jacquemard. Reachability and confluence are undecidable for flat term rewriting systems. Information Processing Letters, 2003, 87 (5), pp.265-270. ⟨inria-00578875⟩
79 View
233 Download

Share

Gmail Facebook Twitter LinkedIn More