Pages that link to "Item:Q4571993"
From MaRDI portal
The following pages link to The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993):
Displayed 2 items.
The following pages link to The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993):
Displayed 2 items.