Sciweavers

ENTCS
2008
89views more  ENTCS 2008»
13 years 4 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 l...
Masahiko Sakai, Yi Wang
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 4 months ago
Partial monoids: associativity and confluence
A partial monoid P is a set with a partial multiplication
Laurent Poinsot, Gérard Duchamp, Christophe...
RTA
2004
Springer
13 years 9 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema