1. Angluin, D.: Finding pattern common to a set of string. In: Proceedings of Symposium on the Theory of Computing, STOC’79, pp. 130–141. ACM, New York (1979)
2. Lecture Notes in Computer Science;W. Charatonik,1991
3. Crochemore, M., Rytter, W.: Periodic prefixes in texts. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II, Positano, 1991, pp. 153–165. Springer, New York (1993)
4. Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, London (1994)
5. Gutierrez, C.: Satisfiability of word equations with constants is in exponential space. In: Proceedings of the Annual Symposium on Foundations of Computer Science, FOCS’98, pp. 112–119. IEEE Comput. Soc. Press, Los Alamitos (1998)