On the dual post correspondence problem

The Dual Post Correspondence Problem asks whether, for a given word α, there exists a pair of distinct morphisms σ, τ, one of which needs to be non-periodic, such that σ(α) = τ(α) is satisfied. This problem is important for the research on equality sets, which are a vital concept in the theory of co...

Full description

Bibliographic Details

Main Authors:	Joel Day, Daniel Reidenbach, Johannes C. Schneider
Format:	Default Conference proceeding
Published:	2013
Subjects:	Other information and computing sciences not elsewhere classified Morphisms Equality sets Dual Post Correspondence Problem Periodicity forcing sets Ambiguity of morphisms Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/14013
Tags:	Add Tag No Tags, Be the first to tag this record!