The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.

Paliath Narendran, Friedrich Otto

Browse the full ICALP paper archive.