@article{oai:nagoya.repo.nii.ac.jp:00019067, author = {Sakai, Masahiko and Wang, Yi}, journal = {Electronic Notes in Theoretical Computer Science}, month = {Apr}, note = {Length-two string rewriting systems are length-preserving string rewriting systems that consist of length-two rules. This paper shows that confluence, termination, left-most termination and right-most termination are undecidable properties for length-two string rewriting systems. These results mean that these properties are undecidable for the class of linear term rewriting systems in which depth-two variables are allowed in both sides of rules., Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007)}, pages = {53--69}, title = {Undecidable Properties on Length-Two String Rewriting Systems}, volume = {204}, year = {2008} }