Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general |
scientific article; zbMATH DE number 985876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general |
scientific article; zbMATH DE number 985876 |
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
0.8549259305000305
0 references
0.8130590319633484
0 references
