[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 1256 || The word matching problem is undecidable for finite special string-rewriting systems that are confluent

✍ Scribed by Degano, Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto

• Book ID: 121079449
• Publisher: Springer Berlin Heidelberg
• Year: 1997
• Weight: 732 KB
• Category: Article
• ISBN: 3540691944
• DOI: 10.1007/3-540-63165-8_218