You can also export the dominoes and try them in the PCP → CFG Ambiguity webtool:
pcp2cfg.
Input format:
This webtool accepts a .mt file describing a Turing Machine created using the
Simulador de Máquina de Turing developed by Prof. Rodrigo Machado:
https://link.inf.ufrgs.br/213-EIJy
The .mt file encodes the input & auxiliary alphabet, states, transitions, marker and blank symbols.
Transition Table
Domino palette
Dominoes are grouped and color-coded by construction step. When “MPCP ⇒ PCP” is checked, you see the PCP instance, but still separated by their original steps.
MPCP Solver (bounded)
PCP is undecidable. This solver performs a bounded search and may fail even if a solution exists.
Workspace (sequence of dominoes)
Drop tiles here in order. You can reorder or delete individual tiles. The Top/Bottom strings below are color-coded according to the step each symbol came from.