1. LNAI,2002
2. A. Aho, J. D. Ullman. The Theory of Parsing, Translation and Compiling, Vol 1: Parsing. Englewood Cliffs, NJ: Prentice-Hall, 1972.
3. A. V. Aho. Algorithms for Finding Patterns in Strings. Handbook of Theoretical Computer Science, pages 290–300. Amsterdam: Elsevier, 1990.
4. D. Angluin. On the complexity of minimum inference of regular sets. Information and Control, 39, 337–350, 1978.
5. D. Angluin. Finding patterns common to a set of strings. In Conference record of the eleventh annual ACM Symposium on Theory of Computing, pages 130–141. New York: ACM Press, 1979.