@article{oai:nagoya.repo.nii.ac.jp:00009341,
 author = {Wang, Yi and Sakai, Masahiko},
 journal = {Proceedings of 17th Int'l Conference on Rewriting Techniqes and Applications, Seattle RTA2006, LNCS},
 month = {},
 note = {We consider several classes of term rewriting systems and prove that termination is de- cidable for these classes. By showing the cycling property of infinite dependency chains, we prove that termination is decidable for semi-constructor case, which is a superclass of right- ground TRSs. By analyzing argument propagation cycles in the dependency graph, we show that termination is also decidable for left-linear shallow TRSs. Moreover we extend these by combining these two techniques., 初出後の修正版。},
 pages = {343--356},
 title = {Decidability of Termination Left-Linear Shallow TRSs and Related Systems for Semi-Constructor TRSs},
 volume = {4098},
 year = {2006}
}