Periodicity forcing words

The Dual Post Correspondence Problem asks, for a given word α, if there exists a non-periodic morphism g and an arbitrary morphism h such that g(α) = h(α). Thus α satisfies the Dual PCP if and only if it belongs to a non-trivial equality set. Words which do not satisfy the Dual PCP are called period...

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 Equality sets Morphisms Dual Post Correspondence Problem Periodicity forcing sets Periodicity forcing words Ambiguity of morphisms Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/14011
Tags:	Add Tag No Tags, Be the first to tag this record!