Loading…
Unambiguous morphic images of strings
We study a fundamental combinatorial problem on morphisms in free semigroups: With regard to any string α over some alphabet we ask for the existence of a morphism σ such that σ(α) is unambiguous, i.e. there is no morphism T with T(i) ≠ σ(i) for some symbol i in α and, nevertheless, T(α) = σ(α). As...
Saved in:
Main Authors: | , , |
---|---|
Format: | Default Article |
Published: |
2006
|
Subjects: | |
Online Access: | https://hdl.handle.net/2134/3464 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|