TY - GEN
T1 - Termination of linear rewriting systems
AU - Dershowitz, Nachum
N1 - Publisher Copyright:
© 1981, Springer-Verlag.
PY - 1981
Y1 - 1981
N2 - Limitations, such as right-linearity, on the form of rules in a term-rewriting system are shown to restrict the class of derivations that must be considered when determining whether or not the system terminates for all inputs. These restricted derivations, termed "chains", are obtained by attempting to apply rules to the final terms of derivations that issue from the left-hand side of rules. Similar limitations are shown to guarantee that combining two terminating systems yields a terminating system.
AB - Limitations, such as right-linearity, on the form of rules in a term-rewriting system are shown to restrict the class of derivations that must be considered when determining whether or not the system terminates for all inputs. These restricted derivations, termed "chains", are obtained by attempting to apply rules to the final terms of derivations that issue from the left-hand side of rules. Similar limitations are shown to guarantee that combining two terminating systems yields a terminating system.
UR - http://www.scopus.com/inward/record.url?scp=85034639398&partnerID=8YFLogxK
U2 - 10.1007/3-540-10843-2_36
DO - 10.1007/3-540-10843-2_36
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85034639398
SN - 9783540108436
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 448
EP - 458
BT - Automata, Languages and Programming - 8th Colloquium
A2 - Even, Shimon
A2 - Kariv, Oded
PB - Springer Verlag
T2 - 8th International Colloquium on Automata, Languages and Programming, ICALP 1981
Y2 - 13 July 1981 through 17 July 1981
ER -