A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On deciding the confluence of a finite string-rewriting system on a given congruence class

1987
*
Journal of computer and system sciences (Print)
*

In general it is undecidable whether or not a given finite string-rewriting system R is confluent on a given congruence class [w]~, even when only length-reducing systems are considered. However, for finite monadic string-rewriting systems this problem becomes decidable in double exponential time. For certain subclasses of monadic string-rewriting systems algorithms of lower complexity are obtained for solving this problem. cl 1987 Academic Press, Inc. String-rewriting systems, also known as

doi:10.1016/0022-0000(87)90017-1
fatcat:uuahdoiqerd7lmkymitfrgngd4