References

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

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org