Termination of the Direct Sum of Rpo-Terminating Term Rewriting Systems

Masahito KURIHARA, Ikuo KAJI

  • Full Text Views

    0

  • Cite this

Summary :

A term rewriting system is said to be rpoterminating if it's termination is proved with the recursive path ordering method. The direct sum R1M2 of term rewriting systems R1 and R2 is rpo-terminating iff both R1 and R2 are so.

Publication
IEICE TRANSACTIONS on transactions Vol.E71-E No.10 pp.975-977
Publication Date
1988/10/25
Publicized
Online ISSN
DOI
Type of Manuscript
LETTER
Category
Automaton, Language and Theory of Computing

Authors

Keyword

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.