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 com...

Full description

Bibliographic Details

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