1. Finding patterns common to a set of strings;Angluin;Journal of Computer and System Sciences,1980
2. Solution to problem E 461;Becker;American Mathematical Monthly,1941
3. Finding a homomorphism between two words is NP-complete;Ehrenfeucht;Information Processing Letters,1979
4. D. Freydenberger, D. Reidenbach, The unambiguity of segmented morphisms, in: Proc. 11th International Conference on Developments in Language Theory, DLT 2007, in: Lecture Notes in Computer Science, 2007
5. Unambiguous morphic images of strings;Freydenberger;International Journal of Foundations of Computer Science,2006