M. Billaud
1993
A problem with words
Letter in Newsgroup Comp.theory
C. Choffrut
1997
Equations in Words
M. Lothaire
Combinatorics on Words
9
Cambbridge University Press
164–183
D.D. Freydenberger
H. Nevisi
D. Reidenbach
2011
Weakly Unambiguous Morphisms
Proc. 28th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2011
LIPIcs
9
213–224
10.4230/LIPIcs.STACS.2011.213
D.D. Freydenberger
D. Reidenbach
2009
The Unambiguity of Segmented Morphisms
Discrete Applied Mathematics
157
3055–3068
10.1016/j.dam.2009.06.009
D.D. Freydenberger
D. Reidenbach
J.C. Schneider
2006
Unambiguous Morphic Images of Strings
International Journal of Foundations of Computer Science
17
601–628
10.1142/S0129054106004017
T. Harju
J. Karhumäki
1997
Morphisms
G. Rozenberg
A. Salomaa
Handbook of Formal Languages
7
1
Springer
439–510
S. Holub
2009
Polynomial-time algorithm for fixed points of nontrivial morphisms
Discrete Mathematics
309
5069–5076
10.1016/j.disc.2009.03.019
F. Levé
G. Richomme
2005
On a conjecture about finite fixed points of morphisms
Theoretical Computer Science
339
103–128
10.1016/j.tcs.2005.01.011
A. Mateescu
A. Salomaa
1997
Patterns
G. Rozenberg
A. Salomaa
Handbook of Formal Languages
4.6
1
Springer
230–242
D. Reidenbach
2008
Discontinuities in pattern inference
Theoretical Computer Science
397
166–193
10.1016/j.tcs.2008.02.029
D. Reidenbach
J.C. Schneider
2009
Morphically primitive words
Theoretical Computer Science
410
2148–2161
10.1016/j.tcs.2009.01.020
D. Reidenbach
J.C. Schneider
2011
Restricted Ambiguity of Erasing Morphisms
Theoretical Computer Science
412
3510–3523
10.1016/j.tcs.2011.02.041
J.C. Schneider
2010
Unambiguous Erasing Morphisms in Free Monoids
Theoretical Informatics and Applications (RAIRO)
44
193–208
10.1051/ita/2009020
A. Thue
1906
Über unendliche Zeichenreihen
Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl.
7