A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Flatwords and Post Correspondence Problem

1996
*
Theoretical Computer Science
*

We investigate properties of flatwords and k-flatwords. In particular, these words are studied in connection with Post Correspondence Problem (PCP). An open problem occurs: where is the borderline between the decidability and the undecidability of k-flat PCP over an alphabet with n symbols? Our main results concern the related new types of prime solutions of PCP. SSDI 0304-3975 (95) 00092-5 94 T Harju et al. I Theoretical Computer Science 161 (1996) 93-108 with re-entrant routines is always a

doi:10.1016/0304-3975(95)00092-5
fatcat:fcwv2jwguzc4tdwca3qamdqgxa