Post correspondence problem with partially commutative alphabets (Q3564877)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5712480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Post correspondence problem with partially commutative alphabets |
scientific article; zbMATH DE number 5712480 |
Statements
Post Correspondence Problem with Partially Commutative Alphabets (English)
0 references
26 May 2010
0 references
Post correspondence problem (PCP)
0 references
morphism
0 references
partially commutative alphabet
0 references
solvability
0 references
equality set
0 references
weak equality set
0 references
reversal bounded multicounter machine
0 references
0.8213542699813843
0 references
0.8160058259963989
0 references
0.7970964312553406
0 references
0.7900391221046448
0 references
0.7853296399116516
0 references
