全文索引广泛应用于数据库、数据压缩、模式匹配算法以及信息生物学等领域。本文研究了后缀自动机全文索引结构,针对后缀自动机空间占用大的问题提出了一种边压缩方法。该方法通过后缀链接函数模拟实现自动机的跳转边,从而删除部分跳转边。在最终的压缩结构中,跳转边的数量与状态数量一致,而在后缀自动机中跳转边的数量是状态数量的一倍。证明了对于因子判定等问题,压缩的后缀自动机与后缀自动机具有相同的时间复杂度。 Full-text index is widely used in databases, data compression, pattern matching algorithms and information biology and other fields. In this paper, we study the full-text index structure of suffix automaton, and propose an edge compression method to solve the problem of large space occupation of suffix automaton. The method through the suffix link function to simulate the automatic machine to jump side, thereby deleting part of the jump side. In the final compression structure, the number of jump edges coincides with the number of states, whereas the number of jump edges in a suffix automaton is twice the number of states. It is proved that the compressed suffix automaton and the suffix automaton have the same time complexity for the problem of factor judgment.