Sciweavers

ENTCS
2008

Undecidable Properties on Length-Two String Rewriting Systems

13 years 5 months ago
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.
Masahiko Sakai, Yi Wang
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where ENTCS
Authors Masahiko Sakai, Yi Wang
Comments (0)