1. Aho, A.V.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Algorithms and Complexity, Handbook of Theoretical Computer Science, vol. A, pp. 255–300. The MIT Press, Cambridge (1990)
2. Amir, A., Benson, G., Farach, M.: Alphabet independent two dimensional matching. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing, STOC 1992, NY, USA, pp. 59–68 (1992). http://doi.acm.org/10.1145/129712.129719
3. Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741–765 (1982)
4. Baeza-Yates, R., Régnier, M.: Fast two-dimensional pattern matching. Inf. Process. Lett. 45(1), 51–57 (1993). http://www.sciencedirect.com/science/article/pii/002001909390250D
5. Baker, T.P.: A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7(4), 533–541 (1978). http://dx.doi.org/10.1137/0207043