For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Termination of the Direct Sum of Rpo-Terminating Term Rewriting Systems
Masahito KURIHARA Ikuo KAJI
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1988/10/25
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Automaton, Language and Theory of Computing
Full Text: PDF(192.1KB)>>
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.