Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general |
scientific article |
Statements
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (English)
0 references
28 February 1997
0 references
Formal languages
0 references
Word equations
0 references
String-rewriting
0 references
0 references
