On weakly confluent monadic string-rewriting systems

On Weakly Confluent Monadic String-Rewriting Systems

Madlener, K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems, Theoretical Computer Science 113 (1993) 119-165. It is investigated as to how far the various decidability results for finite, monadic, and confluent string-rewriting systems can be carried over to the class of finite monadic string-rewriting systems that are only weakly confluent. Here a mon...

On SE-Systems and Monadic String Rewriting Systems

Hyperbolicity of monoids presented by confluent monadic rewriting systems

The geometry of the Cayley graphs of monoids defined by regular confluent monadic rewriting systems is studied. Using geometric and combinatorial arguments, these Cayley graphs are proved to be hyperbolic, and the monoids to be word-hyperbolic in the Duncan–Gilman sense. The hyperbolic boundary of the Cayley graph is described in the case of finite confluent monadic rewriting systems.

On String Rewriting Systems

String rewriting systems, also known as semi-Thue systems, consist of a set of rules l → r, specifying valid replacements of substrings of strings over a given alphabet. In the case of one single rule, it is an open problem whether there is a system that is neither terminating nor looping. Another open question is the decidability of termination. Difficulties arise especially for non-confluent ...

On the Complexity of a Problem on Monadic String Rewriting Systems