Undecidable Properties on Length-Two String Rewriting Systems

Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for length-two string rewriting systems are undecidable properties.

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Masahiko Sakai, Yi Wang
• Keywords: ENTCS 2008, Length-two Rules, String Rewriting, Systems