Undecidable Properties on Length-Two String Rewriting Systems

13 years 11 months ago

Download www.graco.c.u-tokyo.ac.jp

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

Real-time Traffic

ENTCS 2008 | Length-two Rules | String Rewriting | Systems |

claim paper

» Adding constants to string rewriting

» Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems

» Total Termination of Term Rewriting

» The Confluence Problem for Flat TRSs

» On Decidability of LTL Model Checking for Process Rewrite Systems

» Proving Injectivity of Functions via Program Inversion in Term Rewriting

» Tile Rewriting Grammars

» Open Closed Open

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Masahiko Sakai, Yi Wang

Comments (0)

Sciweavers

Undecidable Properties on Length-Two String Rewriting Systems

ENTCS 2008 | Length-two Rules | String Rewriting | Systems |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers