The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993)
From MaRDI portal
scientific article; zbMATH DE number 6898416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The word matching problem is undecidable for finite special string-rewriting systems that are confluent |
scientific article; zbMATH DE number 6898416 |
Statements
The word matching problem is undecidable for finite special string-rewriting systems that are confluent (English)
0 references
4 July 2018
0 references
