The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The (generalized) Post correspondence problem with lists consisting of two words is decidable |
scientific article |
Statements
The (generalized) Post correspondence problem with lists consisting of two words is decidable (English)
0 references
1982
0 references
Turing machines
0 references
decidability
0 references
word problem
0 references
homomorphic equality
0 references
0 references
