Misplaced Pages

Suffix automaton
Type	Substring index
Invented	1983
Invented by	Anselm Blumer; Janet Blumer; Andrzej Ehrenfeucht; David Haussler; Ross McConnell
Time complexity in big O notation Operation Average Worst case Space complexity Space ${\displaystyle O(n)}$ ${\displaystyle O(n)}$

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage, processing, and retrieval of compressed information about all its substrings. The suffix automaton of a string ${\displaystyle S}$ is the smallest directed acyclic graph with a dedicated initial vertex and a set of "final" vertices, such that paths from the initial vertex to final vertices represent the suffixes of the string.

In terms of automata theory, a suffix automaton is the minimal partial deterministic finite automaton that recognizes the set of suffixes of a given string ${\displaystyle S=s_{1}s_{2}\dots s_{n}}$. The state graph of a suffix automaton is called a directed acyclic word graph (DAWG), a term that is also sometimes used for any deterministic acyclic finite state automaton.

Suffix automata were introduced in 1983 by a group of scientists from the University of Denver and the University of Colorado Boulder. They suggested a linear time online algorithm for its construction and showed that the suffix automaton of a string ${\displaystyle S}$ having length at least two characters has at most ${\textstyle 2|S|-1}$ states and at most ${\textstyle 3|S|-4}$ transitions. Further works have shown a close connection between suffix automata and suffix trees, and have outlined several generalizations of suffix automata, such as compacted suffix automaton obtained by compression of nodes with a single outgoing arc.

Suffix automata provide efficient solutions to problems such as substring search and computation of the largest common substring of two and more strings.

History

The concept of suffix automaton was introduced in 1983 by a group of scientists from University of Denver and University of Colorado Boulder consisting of Anselm Blumer, Janet Blumer, Andrzej Ehrenfeucht, David Haussler and Ross McConnell, although similar concepts had earlier been studied alongside suffix trees in the works of Peter Weiner, Vaughan Pratt and Anatol Slissenko. In their initial work, Blumer et al. showed a suffix automaton built for the string ${\displaystyle S}$ of length greater than ${\displaystyle 1}$ has at most ${\displaystyle 2|S|-1}$ states and at most ${\displaystyle 3|S|-4}$ transitions, and suggested a linear algorithm for automaton construction.

In 1983, Mu-Tian Chen and Joel Seiferas independently showed that Weiner's 1973 suffix-tree construction algorithm while building a suffix tree of the string ${\displaystyle S}$ constructs a suffix automaton of the reversed string ${\textstyle S^{R}}$ as an auxiliary structure. In 1987, Blumer et al. applied the compressing technique used in suffix trees to a suffix automaton and invented the compacted suffix automaton, which is also called the compacted directed acyclic word graph (CDAWG). In 1997, Maxime Crochemore and Renaud Vérin developed a linear algorithm for direct CDAWG construction. In 2001, Shunsuke Inenaga et al. developed an algorithm for construction of CDAWG for a set of words given by a trie.

Definitions

Usually when speaking about suffix automata and related concepts, some notions from formal language theory and automata theory are used, in particular:

• "Alphabet" is a finite set ${\displaystyle \Sigma }$ that is used to construct words. Its elements are called "characters";
• "Word" is a finite sequence of characters ${\displaystyle \omega =\omega _{1}\omega _{2}\dots \omega _{n}}$. "Length" of the word ${\displaystyle \omega }$ is denoted as ${\displaystyle |\omega |=n}$;
• "Formal language" is a set of words over given alphabet;
• "Language of all words" is denoted as ${\displaystyle \Sigma ^{*}}$(where the "*" character stands for Kleene star), "empty word" (the word of zero length) is denoted by the character ${\displaystyle \varepsilon }$;
• "Concatenation of words" ${\displaystyle \alpha =\alpha _{1}\alpha _{2}\dots \alpha _{n}}$ and ${\displaystyle \beta =\beta _{1}\beta _{2}\dots \beta _{m}}$ is denoted as ${\displaystyle \alpha \cdot \beta }$ or ${\displaystyle \alpha \beta }$ and corresponds to the word obtained by writing ${\displaystyle \beta }$ to the right of ${\displaystyle \alpha }$, that is, ${\displaystyle \alpha \beta =\alpha _{1}\alpha _{2}\dots \alpha _{n}\beta _{1}\beta _{2}\dots \beta _{m}}$;
• "Concatenation of languages" ${\displaystyle A}$ and ${\displaystyle B}$ is denoted as ${\displaystyle A\cdot B}$ or ${\displaystyle AB}$ and corresponds to the set of pairwise concatenations ${\displaystyle AB=\{\alpha \beta :\alpha \in A,\beta \in B\}}$;
• If the word ${\displaystyle \omega \in \Sigma ^{*}}$ may be represented as ${\displaystyle \omega =\alpha \gamma \beta }$, where ${\displaystyle \alpha ,\beta ,\gamma \in \Sigma ^{*}}$, then words ${\displaystyle \alpha }$, ${\displaystyle \beta }$ and ${\displaystyle \gamma }$ are called "prefix", "suffix" and "subword" (substring) of the word ${\displaystyle \omega }$ correspondingly;
• If ${\displaystyle T=T_{1}\dots T_{n}}$ and ${\displaystyle T_{l}T_{l+1}\dots T_{r}=S}$ (with ${\displaystyle 1\leq l\leq r\leq n}$) then ${\displaystyle S}$ is said to "occur" in ${\displaystyle T}$ as a subword. Here ${\displaystyle l}$ and ${\displaystyle r}$ are called left and right positions of occurrence of ${\displaystyle S}$ in ${\displaystyle T}$ correspondingly.

Automaton structure

Formally, deterministic finite automaton is determined by 5-tuple ${\displaystyle {\mathcal {A}}=(\Sigma ,Q,q_{0},F,\delta )}$, where:

• ${\displaystyle \Sigma }$ is an "alphabet" that is used to construct words,
• ${\displaystyle Q}$ is a set of automaton "states",
• ${\displaystyle q_{0}\in Q}$ is an "initial" state of automaton,
• ${\displaystyle F\subset Q}$ is a set of "final" states of automaton,
• ${\displaystyle \delta :Q\times \Sigma \mapsto Q}$ is a partial "transition" function of automaton, such that ${\displaystyle \delta (q,\sigma )}$ for ${\displaystyle q\in Q}$ and ${\displaystyle \sigma \in \Sigma }$ is either undefined or defines a transition from ${\displaystyle q}$ over character ${\displaystyle \sigma }$.

Most commonly, deterministic finite automaton is represented as a directed graph ("diagram") such that:

• Set of graph vertices corresponds to the state of states ${\displaystyle Q}$,
• Graph has a specific marked vertex corresponding to initial state ${\displaystyle q_{0}}$,
• Graph has several marked vertices corresponding to the set of final states ${\displaystyle F}$,
• Set of graph arcs corresponds to the set of transitions ${\displaystyle \delta }$,
• Specifically, every transition ${\textstyle \delta (q_{1},\sigma )=q_{2}}$ is represented by an arc from ${\displaystyle q_{1}}$ to ${\displaystyle q_{2}}$ marked with the character ${\displaystyle \sigma }$. This transition also may be denoted as ${\textstyle q_{1}{\begin{smallmatrix}{\sigma }\\{\longrightarrow }\end{smallmatrix}}q_{2}}$.

In terms of its diagram, the automaton recognizes the word ${\displaystyle \omega =\omega _{1}\omega _{2}\dots \omega _{m}}$ only if there is a path from the initial vertex ${\displaystyle q_{0}}$ to some final vertex ${\displaystyle q\in F}$ such that concatenation of characters on this path forms ${\displaystyle \omega }$. The set of words recognized by an automaton forms a language that is set to be recognized by the automaton. In these terms, the language recognized by a suffix automaton of ${\displaystyle S}$ is the language of its (possibly empty) suffixes.

Automaton states

"Right context" of the word ${\displaystyle \omega }$ with respect to language ${\displaystyle L}$ is a set ${\displaystyle _{R}=\{\alpha :\omega \alpha \in L\}}$ that is a set of words ${\displaystyle \alpha }$ such that their concatenation with ${\displaystyle \omega }$ forms a word from ${\displaystyle L}$. Right contexts induce a natural equivalence relation ${\displaystyle _{R}=_{R}}$ on the set of all words. If language ${\displaystyle L}$ is recognized by some deterministic finite automaton, there exists unique up to isomorphism automaton that recognizes the same language and has the minimum possible number of states. Such an automaton is called a minimal automaton for the given language ${\displaystyle L}$. Myhill–Nerode theorem allows it to define it explicitly in terms of right contexts:

Theorem — Minimal automaton recognizing language ${\displaystyle L}$ over the alphabet ${\displaystyle \Sigma }$ may be explicitly defined in the following way:

• Alphabet ${\displaystyle \Sigma }$ stays the same,
• States ${\displaystyle Q}$ correspond to right contexts ${\displaystyle _{R}}$ of all possible words ${\displaystyle \omega \in \Sigma ^{*}}$,
• Initial state ${\displaystyle q_{0}}$ corresponds to the right context of the empty word ${\displaystyle _{R}}$,
• Final states ${\displaystyle F}$ correspond to right contexts ${\displaystyle _{R}}$ of words from ${\displaystyle \omega \in L}$,
• Transitions ${\displaystyle \delta }$ are given by ${\displaystyle _{R}{\begin{smallmatrix}{\sigma }\\{\longrightarrow }\end{smallmatrix}}_{R}}$, where ${\displaystyle \omega \in \Sigma ^{*}}$ and ${\displaystyle \sigma \in \Sigma }$.

In these terms, a "suffix automaton" is the minimal deterministic finite automaton recognizing the language of suffixes of the word ${\displaystyle S=s_{1}s_{2}\dots s_{n}}$. The right context of the word ${\displaystyle \omega }$ with respect to this language consists of words ${\displaystyle \alpha }$, such that ${\displaystyle \omega \alpha }$ is a suffix of ${\displaystyle S}$. It allows to formulate the following lemma defining a bijection between the right context of the word and the set of right positions of its occurrences in ${\displaystyle S}$:

Theorem — Let ${\displaystyle endpos(\omega )=\{r:\omega =s_{l}\dots s_{r}\}}$ be the set of right positions of occurrences of ${\displaystyle \omega }$ in ${\displaystyle S}$.

There is a following bijection between ${\displaystyle endpos(\omega )}$ and ${\displaystyle _{R}}$:

• If ${\displaystyle x\in endpos(\omega )}$, then ${\displaystyle s_{x+1}s_{x+2}\dots s_{n}\in _{R}}$;
• If ${\displaystyle \alpha \in _{R}}$, then ${\displaystyle n-\vert \alpha \vert \in endpos(\omega )}$.

For example, for the word ${\displaystyle S=abacaba}$ and its subword ${\displaystyle \omega =ab}$, it holds ${\displaystyle endpos(ab)=\{2,6\}}$ and ${\displaystyle _{R}=\{a,acaba\}}$. Informally, ${\displaystyle _{R}}$ is formed by words that follow occurrences of ${\displaystyle ab}$ to the end of ${\displaystyle S}$ and ${\displaystyle endpos(ab)}$ is formed by right positions of those occurrences. In this example, the element ${\displaystyle x=2\in endpos(ab)}$ corresponds with the word ${\displaystyle s_{3}s_{4}s_{5}s_{6}s_{7}=acaba\in _{R}}$ while the word ${\displaystyle a\in _{R}}$ corresponds with the element ${\displaystyle 7-|a|=6\in endpos(ab)}$.

It implies several structure properties of suffix automaton states. Let ${\displaystyle |\alpha |\leq |\beta |}$, then:

• If ${\displaystyle _{R}}$ and ${\displaystyle _{R}}$ have at least one common element ${\displaystyle x}$, then ${\displaystyle endpos(\alpha )}$ and ${\displaystyle endpos(\beta )}$ have a common element as well. It implies ${\displaystyle \alpha }$ is a suffix of ${\displaystyle \beta }$ and therefore ${\displaystyle endpos(\beta )\subset endpos(\alpha )}$ and ${\displaystyle _{R}\subset _{R}}$. In aforementioned example, ${\displaystyle a\in _{R}\cap _{R}}$, so ${\displaystyle ab}$ is a suffix of ${\displaystyle cab}$ and thus ${\displaystyle _{R}=\{a\}\subset \{a,acaba\}=_{R}}$ and ${\displaystyle endpos(cab)=\{6\}\subset \{2,6\}=endpos(ab)}$;
• If ${\displaystyle _{R}=_{R}}$, then ${\displaystyle endpos(\alpha )=endpos(\beta )}$, thus ${\displaystyle \alpha }$ occurs in ${\displaystyle S}$ only as a suffix of ${\displaystyle \beta }$. For example, for ${\displaystyle \alpha =b}$ and ${\displaystyle \beta =ab}$ it holds that ${\displaystyle _{R}=_{R}=\{a,acaba\}}$ and ${\displaystyle endpos(b)=endpos(ab)=\{2,6\}}$;
• If ${\displaystyle _{R}=_{R}}$ and ${\displaystyle \gamma }$ is a suffix of ${\displaystyle \beta }$ such that ${\displaystyle |\alpha |\leq |\gamma |\leq |\beta |}$, then ${\displaystyle _{R}=_{R}=_{R}}$. In the example above ${\displaystyle _{R}=_{R}=\{aba\}}$ and it holds for "intermediate" suffix ${\displaystyle \gamma =ac}$ that ${\displaystyle _{R}=\{aba\}}$.

Any state ${\displaystyle q=_{R}}$ of the suffix automaton recognizes some continuous chain of nested suffixes of the longest word recognized by this state.

"Left extension" ${\displaystyle {\overset {\scriptstyle {\leftarrow }}{\gamma }}}$ of the string ${\displaystyle \gamma }$ is the longest string ${\displaystyle \omega }$ that has the same right context as ${\displaystyle \gamma }$. Length ${\displaystyle |{\overset {\scriptstyle {\leftarrow }}{\gamma }}|}$ of the longest string recognized by ${\displaystyle q=_{R}}$ is denoted by ${\displaystyle len(q)}$. It holds:

Theorem — Left extension of ${\displaystyle \gamma }$ may be represented as ${\displaystyle {\overleftarrow {\gamma }}=\beta \gamma }$, where ${\displaystyle \beta }$ is the longest word such that any occurrence of ${\displaystyle \gamma }$ in ${\displaystyle S}$ is preceded by ${\displaystyle \beta }$.

"Suffix link" ${\displaystyle link(q)}$ of the state ${\displaystyle q=_{R}}$ is the pointer to the state ${\displaystyle p}$ that contains the largest suffix of ${\displaystyle \alpha }$ that is not recognized by ${\displaystyle q}$.

In this terms it can be said ${\displaystyle q=_{R}}$ recognizes exactly all suffixes of ${\displaystyle {\overset {\scriptstyle {\leftarrow }}{\alpha }}}$ that is longer than ${\displaystyle len(link(q))}$ and not longer than ${\displaystyle len(q)}$. It also holds:

Theorem — Suffix links form a tree ${\displaystyle {\mathcal {T}}(V,E)}$ that may be defined explicitly in the following way:

1. Vertices ${\displaystyle V}$ of the tree correspond to left extensions ${\displaystyle {\overleftarrow {\omega }}}$ of all ${\displaystyle S}$ substrings,
2. Edges ${\displaystyle E}$ of the tree connect pairs of vertices ${\displaystyle ({\overleftarrow {\omega }},{\overleftarrow {\alpha \omega }})}$, such that ${\displaystyle \alpha \in \Sigma }$ and ${\displaystyle {\overleftarrow {\omega }}\neq {\overleftarrow {\alpha \omega }}}$.

Connection with suffix trees

A "prefix tree" (or "trie") is a rooted directed tree in which arcs are marked by characters in such a way no vertex ${\displaystyle v}$ of such tree has two out-going arcs marked with the same character. Some vertices in trie are marked as final. Trie is said to recognize a set of words defined by paths from its root to final vertices. In this way prefix trees are a special kind of deterministic finite automata if you perceive its root as an initial vertex. The "suffix trie" of the word ${\displaystyle S}$ is a prefix tree recognizing a set of its suffixes. "A suffix tree" is a tree obtained from a suffix trie via the compaction procedure, during which consequent edges are merged if the degree of the vertex between them is equal to two.

By its definition, a suffix automaton can be obtained via minimization of the suffix trie. It may be shown that a compacted suffix automaton is obtained by both minimization of the suffix tree (if one assumes each string on the edge of the suffix tree is a solid character from the alphabet) and compaction of the suffix automaton. Besides this connection between the suffix tree and the suffix automaton of the same string there is as well a connection between the suffix automaton of the string ${\displaystyle S=s_{1}s_{2}\dots s_{n}}$ and the suffix tree of the reversed string ${\displaystyle S^{R}=s_{n}s_{n-1}\dots s_{1}}$.

Similarly to right contexts one may introduce "left contexts" ${\displaystyle _{L}=\{\beta \in \Sigma ^{*}:\beta \omega \in L\}}$, "right extensions" ${\displaystyle {\overset {\scriptstyle {\rightarrow }}{\omega ~}}}$ corresponding to the longest string having same left context as ${\displaystyle \omega }$ and the equivalence relation ${\displaystyle _{L}=_{L}}$. If one considers right extensions with respect to the language ${\displaystyle L}$ of "prefixes" of the string ${\displaystyle S}$ it may be obtained:

Theorem — Suffix tree of the string ${\displaystyle S}$ may be defined explicitly in the following way:

• Vertices ${\displaystyle V}$ of the tree correspond to right extensions ${\displaystyle {\overrightarrow {\omega }}}$ of all ${\displaystyle S}$ substrings,
• Edges ${\displaystyle E}$ correspond to triplets ${\displaystyle ({\overrightarrow {\omega }},x\alpha ,{\overrightarrow {\omega x}})}$ such that ${\displaystyle x\in \Sigma }$ and ${\displaystyle {\overrightarrow {\omega x}}={\overrightarrow {\omega }}x\alpha }$.

Here triplet ${\displaystyle (v_{1},\omega ,v_{2})\in E}$ means there is an edge from ${\displaystyle v_{1}}$ to ${\displaystyle v_{2}}$ with the string ${\displaystyle \omega }$ written on it

, which implies the suffix link tree of the string ${\displaystyle S}$ and the suffix tree of the string ${\displaystyle S^{R}}$ are isomorphic:

Similarly to the case of left extensions, the following lemma holds for right extensions:

Theorem — Right extension of the string ${\displaystyle \gamma }$ may be represented as ${\displaystyle {\overrightarrow {\gamma }}=\gamma \alpha }$, where ${\displaystyle \alpha }$ is the longest word such that every occurrence of ${\displaystyle \gamma }$ in ${\displaystyle S}$ is succeeded by ${\displaystyle \alpha }$.

Size

A suffix automaton of the string ${\displaystyle S}$ of length ${\displaystyle n>1}$ has at most ${\displaystyle 2n-1}$ states and at most ${\displaystyle 3n-4}$ transitions. These bounds are reached on strings ${\displaystyle abb\dots bb=ab^{n-1}}$ and ${\displaystyle abb\dots bc=ab^{n-2}c}$ correspondingly. This may be formulated in a stricter way as ${\displaystyle |\delta |\leq |Q|+n-2}$ where ${\displaystyle |\delta |}$ and ${\displaystyle |Q|}$ are the numbers of transitions and states in automaton correspondingly.

Construction

Initially the automaton only consists of a single state corresponding to the empty word, then characters of the string are added one by one and the automaton is rebuilt on each step incrementally.

State updates

After a new character is appended to the string, some equivalence classes are altered. Let ${\displaystyle _{R_{\omega }}}$ be the right context of ${\displaystyle \alpha }$ with respect to the language of ${\displaystyle \omega }$ suffixes. Then the transition from ${\displaystyle _{R_{\omega }}}$ to ${\displaystyle _{R_{\omega x}}}$ after ${\displaystyle x}$ is appended to ${\displaystyle \omega }$ is defined by lemma:

Theorem — Let ${\displaystyle \alpha ,\omega \in \Sigma ^{*}}$ be some words over ${\displaystyle \Sigma }$ and ${\displaystyle x\in \Sigma }$ be some character from this alphabet. Then there is a following correspondence between ${\displaystyle _{R_{\omega }}}$ and ${\displaystyle _{R_{\omega x}}}$:

• ${\displaystyle _{R_{\omega x}}=_{R_{\omega }}x\cup \{\varepsilon \}}$ if ${\displaystyle \alpha }$ is a suffix of ${\displaystyle \omega x}$;
• ${\displaystyle _{R_{\omega x}}=_{R_{\omega }}x}$ otherwise.

After adding ${\displaystyle x}$ to the current word ${\displaystyle \omega }$ the right context of ${\displaystyle \alpha }$ may change significantly only if ${\displaystyle \alpha }$ is a suffix of ${\displaystyle \omega x}$. It implies equivalence relation ${\displaystyle \equiv _{R_{\omega x}}}$ is a refinement of ${\displaystyle \equiv _{R_{\omega }}}$. In other words, if ${\displaystyle _{R_{\omega x}}=_{R_{\omega x}}}$, then ${\displaystyle _{R_{\omega }}=_{R_{\omega }}}$. After the addition of a new character at most two equivalence classes of ${\displaystyle \equiv _{R_{\omega }}}$ will be split and each of them may split in at most two new classes. First, equivalence class corresponding to empty right context is always split into two equivalence classes, one of them corresponding to ${\displaystyle \omega x}$ itself and having ${\displaystyle \{\varepsilon \}}$ as a right context. This new equivalence class contains exactly ${\displaystyle \omega x}$ and all its suffixes that did not occur in ${\displaystyle \omega }$, as the right context of such words was empty before and contains only empty word now.

Given the correspondence between states of the suffix automaton and vertices of the suffix tree, it is possible to find out the second state that may possibly split after a new character is appended. The transition from ${\displaystyle \omega }$ to ${\displaystyle \omega x}$ corresponds to the transition from ${\displaystyle \omega ^{R}}$ to ${\displaystyle x\omega ^{R}}$ in the reversed string. In terms of suffix trees it corresponds to the insertion of the new longest suffix ${\displaystyle x\omega ^{R}}$ into the suffix tree of ${\displaystyle \omega ^{R}}$. At most two new vertices may be formed after this insertion: one of them corresponding to ${\displaystyle x\omega ^{R}}$, while the other one corresponds to its direct ancestor if there was a branching. Returning to suffix automata, it means the first new state recognizes ${\displaystyle \omega x}$ and the second one (if there is a second new state) is its suffix link. It may be stated as a lemma:

Theorem — Let ${\displaystyle \omega \in \Sigma ^{*}}$, ${\displaystyle x\in \Sigma }$ be some word and character over ${\displaystyle \Sigma }$. Also let ${\displaystyle \alpha }$ be the longest suffix of ${\displaystyle \omega x}$, which occurs in ${\displaystyle \omega }$, and let ${\displaystyle \beta ={\overset {\scriptstyle {\leftarrow }}{\alpha }}}$. Then for any substrings ${\displaystyle u,v}$ of ${\displaystyle \omega }$ it holds:

• If ${\displaystyle _{R_{\omega }}=_{R_{\omega }}}$ and ${\displaystyle _{R_{\omega }}\neq _{R_{\omega }}}$, then ${\displaystyle _{R_{\omega x}}=_{R_{\omega x}}}$;
• If ${\displaystyle _{R_{\omega }}=_{R_{\omega }}}$ and ${\displaystyle \vert u\vert \leq \vert \alpha \vert }$, then ${\displaystyle _{R_{\omega x}}=_{R_{\omega x}}}$;
• If ${\displaystyle _{R_{\omega }}=_{R_{\omega }}}$ and ${\displaystyle \vert u\vert >\vert \alpha \vert }$, then ${\displaystyle _{R_{\omega x}}=_{R_{\omega x}}}$.

It implies that if ${\displaystyle \alpha =\beta }$ (for example, when ${\displaystyle x}$ didn't occur in ${\displaystyle \omega }$ at all and ${\displaystyle \alpha =\beta =\varepsilon }$), then only the equivalence class corresponding to the empty right context is split.

Besides suffix links it is also needed to define final states of the automaton. It follows from structure properties that all suffixes of a word ${\displaystyle \alpha }$ recognized by ${\displaystyle q=_{R}}$ are recognized by some vertex on suffix path ${\displaystyle (q,link(q),link^{2}(q),\dots )}$ of ${\displaystyle q}$. Namely, suffixes with length greater than ${\displaystyle len(link(q))}$ lie in ${\displaystyle q}$, suffixes with length greater than ${\displaystyle len(link(link(q))}$ but not greater than ${\displaystyle len(link(q))}$ lie in ${\displaystyle link(q)}$ and so on. Thus if the state recognizing ${\displaystyle \omega }$ is denoted by ${\displaystyle last}$, then all final states (that is, recognizing suffixes of ${\displaystyle \omega }$) form up the sequence ${\displaystyle (last,link(last),link^{2}(last),\dots )}$.

Transitions and suffix links updates

After the character ${\displaystyle x}$ is appended to ${\displaystyle \omega }$ possible new states of suffix automaton are ${\displaystyle _{R_{\omega x}}}$ and ${\displaystyle _{R_{\omega x}}}$. Suffix link from ${\displaystyle _{R_{\omega x}}}$ goes to ${\displaystyle _{R_{\omega x}}}$ and from ${\displaystyle _{R_{\omega x}}}$ it goes to ${\displaystyle link(_{R_{\omega }})}$. Words from ${\displaystyle _{R_{\omega x}}}$ occur in ${\displaystyle \omega x}$ only as its suffixes therefore there should be no transitions at all from ${\displaystyle _{R_{\omega x}}}$ while transitions to it should go from suffixes of ${\displaystyle \omega }$ having length at least ${\displaystyle \alpha }$ and be marked with the character ${\displaystyle x}$. State ${\displaystyle _{R_{\omega x}}}$ is formed by subset of ${\displaystyle _{R_{\omega }}}$, thus transitions from ${\displaystyle _{R_{\omega x}}}$ should be same as from ${\displaystyle _{R_{\omega }}}$. Meanwhile, transitions leading to ${\displaystyle _{R_{\omega x}}}$ should go from suffixes of ${\displaystyle \omega }$ having length less than ${\displaystyle |\alpha |}$ and at least ${\displaystyle len(link(_{R_{\omega }}))}$, as such transitions have led to ${\displaystyle _{R_{\omega }}}$ before and corresponded to seceded part of this state. States corresponding to these suffixes may be determined via traversal of suffix link path for ${\displaystyle _{R_{\omega }}}$.

Construction of the suffix automaton for the word abbcbc
∅ → a After first character is appended, only one state is created in suffix automaton. Similarly, only one leaf is added to the suffix tree.	a → ab New transitions are drawn from all previous final states as b didn't appear before. For the same reason another leaf is added to the root of the suffix tree.
ab → abb The state 2 recognizes words ab and b, but only b is the new suffix, therefore this word is separated into state 4. In the suffix tree it corresponds to the split of the edge leading to the vertex 2.	abb → abbc Character c occurs for the first time, so transitions are drawn from all previous final states. Suffix tree of reverse string has another leaf added to the root.
abbc → abbcb State 4 consists of the only word b, which is suffix, thus the state is not split. Correspondingly, new leaf is hanged on the vertex 4 in the suffix tree.	abbcb → abbcbc The state 5 recognizes words abbc, bbc, bc and c, but only last two are suffixes of new word, so they're separated into new state 8. Correspondingly, edge leading to the vertex 5 is split and vertex 8 is put in the middle of the edge.

Construction algorithm

Theoretical results above lead to the following algorithm that takes character ${\displaystyle x}$ and rebuilds the suffix automaton of ${\displaystyle \omega }$ into the suffix automaton of ${\displaystyle \omega x}$:

1. The state corresponding to the word ${\displaystyle \omega }$ is kept as ${\displaystyle last}$;
2. After ${\displaystyle x}$ is appended, previous value of ${\displaystyle last}$ is stored in the variable ${\displaystyle p}$ and ${\displaystyle last}$ itself is reassigned to the new state corresponding to ${\displaystyle \omega x}$;
3. States corresponding to suffixes of ${\displaystyle \omega }$ are updated with transitions to ${\displaystyle last}$. To do this one should go through ${\displaystyle p,link(p),link^{2}(p),\dots }$, until there is a state that already has a transition by ${\displaystyle x}$;
4. Once the aforementioned loop is over, there are 3 cases:
   1. If none of states on the suffix path had a transition by ${\displaystyle x}$, then ${\displaystyle x}$ never occurred in ${\displaystyle \omega }$ before and the suffix link from ${\displaystyle last}$ should lead to ${\displaystyle q_{0}}$;
   2. If the transition by ${\displaystyle x}$ is found and leads from the state ${\displaystyle p}$ to the state ${\displaystyle q}$, such that ${\displaystyle len(p)+1=len(q)}$, then ${\displaystyle q}$ does not have to be split and it is a suffix link of ${\displaystyle last}$;
   3. If the transition is found but ${\displaystyle len(q)>len(p)+1}$, then words from ${\displaystyle q}$ having length at most ${\displaystyle len(p)+1}$ should be segregated into new "clone" state ${\displaystyle cl}$;
5. If the previous step was concluded with the creation of ${\displaystyle cl}$, transitions from it and its suffix link should copy those of ${\displaystyle q}$, at the same time ${\displaystyle cl}$ is assigned to be common suffix link of both ${\displaystyle q}$ and ${\displaystyle last}$;
6. Transitions that have led to ${\displaystyle q}$ before but corresponded to words of the length at most ${\displaystyle len(p)+1}$ are redirected to ${\displaystyle cl}$. To do this, one continues going through the suffix path of ${\displaystyle p}$ until the state is found such that transition by ${\displaystyle x}$ from it doesn't lead to ${\displaystyle q}$.

The whole procedure is described by the following pseudo-code:

function add_letter(x):
    define p = last
    assign last = new_state()
    assign len(last) = len(p) + 1
    while δ(p, x) is undefined:
        assign δ(p, x) = last, p = link(p)
    define q = δ(p, x)
    if q = last:
        assign link(last) = q0
    else if len(q) = len(p) + 1:
        assign link(last) = q
    else:
        define cl = new_state()
        assign len(cl) = len(p) + 1
        assign δ(cl) = δ(q), link(cl) = link(q)
        assign link(last) = link(q) = cl
        while δ(p, x) = q:
            assign δ(p, x) = cl, p = link(p)

Here ${\displaystyle q_{0}}$ is the initial state of the automaton and ${\displaystyle new\_state()}$ is a function creating new state for it. It is assumed ${\displaystyle last}$, ${\displaystyle len}$, ${\displaystyle link}$ and ${\displaystyle \delta }$ are stored as global variables.

Complexity

Complexity of the algorithm may vary depending on the underlying structure used to store transitions of the automaton. It may be implemented in ${\displaystyle O(n\log |\Sigma |)}$ with ${\displaystyle O(n)}$ memory overhead or in ${\displaystyle O(n)}$ with ${\displaystyle O(n|\Sigma |)}$ memory overhead if one assumes that memory allocation is done in ${\displaystyle O(1)}$. To obtain such complexity, one has to use the methods of amortized analysis. The value of ${\displaystyle len(p)}$ strictly reduces with each iteration of the cycle while it may only increase by as much as one after the first iteration of the cycle on the next add_letter call. Overall value of ${\displaystyle len(p)}$ never exceeds ${\displaystyle n}$ and it is only increased by one between iterations of appending new letters that suggest total complexity is at most linear as well. The linearity of the second cycle is shown in a similar way.

Generalizations

The suffix automaton is closely related to other suffix structures and substring indices. Given a suffix automaton of a specific string one may construct its suffix tree via compacting and recursive traversal in linear time. Similar transforms are possible in both directions to switch between the suffix automaton of ${\displaystyle S}$ and the suffix tree of reversed string ${\displaystyle S^{R}}$. Other than this several generalizations were developed to construct an automaton for the set of strings given by trie, compacted suffix automation (CDAWG), to maintain the structure of the automaton on the sliding window, and to construct it in a bidirectional way, supporting the insertion of a characters to both the beginning and the end of the string.

Compacted suffix automaton

As was already mentioned above, a compacted suffix automaton is obtained via both compaction of a regular suffix automaton (by removing states which are non-final and have exactly one out-going arc) and the minimization of a suffix tree. Similarly to the regular suffix automaton, states of compacted suffix automaton may be defined in explicit manner. A two-way extension ${\displaystyle {\overset {\scriptstyle {\longleftrightarrow }}{\gamma }}}$ of a word ${\displaystyle \gamma }$ is the longest word ${\displaystyle \omega =\beta \gamma \alpha }$, such that every occurrence of ${\displaystyle \gamma }$ in ${\displaystyle S}$ is preceded by ${\displaystyle \beta }$ and succeeded by ${\displaystyle \alpha }$. In terms of left and right extensions it means that two-way extension is the left extension of the right extension or, which is equivalent, the right extension of the left extension, that is ${\textstyle {\overset {\scriptstyle \longleftrightarrow }{\gamma }}={\overset {\scriptstyle \leftarrow }{\overset {\rightarrow }{\gamma }}}={\overset {\rightarrow }{\overset {\scriptstyle \leftarrow }{\gamma }}}}$. In terms of two-way extensions compacted automaton is defined as follows:

Theorem — Compacted suffix automaton of the word ${\displaystyle S}$ is defined by a pair ${\displaystyle (V,E)}$, where:

• ${\displaystyle V=\{{\overleftrightarrow {\omega }}:\omega \in \Sigma ^{*}\}}$ is a set of automaton states;
• ${\displaystyle E=\{({\overleftrightarrow {\omega }},x\alpha ,{\overleftrightarrow {\omega x}}):x\in \Sigma ,\alpha \in \Sigma ^{*},{\overleftrightarrow {\omega x}}={\overleftrightarrow {\omega }}x\alpha \}}$ is a set of automaton transitions.

Two-way extensions induce an equivalence relation ${\textstyle {\overset {\scriptstyle \longleftrightarrow }{\alpha }}={\overset {\scriptstyle \longleftrightarrow }{\beta }}}$ which defines the set of words recognized by the same state of compacted automaton. This equivalence relation is a transitive closure of the relation defined by ${\textstyle ({\overset {\scriptstyle {\rightarrow }}{\alpha \,}}={\overset {\scriptstyle {\rightarrow }}{\beta \,}})\vee ({\overset {\scriptstyle {\leftarrow }}{\alpha }}={\overset {\scriptstyle {\leftarrow }}{\beta }})}$, which highlights the fact that a compacted automaton may be obtained by both gluing suffix tree vertices equivalent via ${\displaystyle {\overset {\scriptstyle {\leftarrow }}{\alpha }}={\overset {\scriptstyle {\leftarrow }}{\beta }}}$ relation (minimization of the suffix tree) and gluing suffix automaton states equivalent via ${\displaystyle {\overset {\scriptstyle {\rightarrow }}{\alpha \,}}={\overset {\scriptstyle {\rightarrow }}{\beta \,}}}$ relation (compaction of suffix automaton). If words ${\displaystyle \alpha }$ and ${\displaystyle \beta }$ have same right extensions, and words ${\displaystyle \beta }$ and ${\displaystyle \gamma }$ have same left extensions, then cumulatively all strings ${\displaystyle \alpha }$, ${\displaystyle \beta }$ and ${\displaystyle \gamma }$ have same two-way extensions. At the same time it may happen that neither left nor right extensions of ${\displaystyle \alpha }$ and ${\displaystyle \gamma }$ coincide. As an example one may take ${\displaystyle S=\beta =ab}$, ${\displaystyle \alpha =a}$ and ${\displaystyle \gamma =b}$, for which left and right extensions are as follows: ${\displaystyle {\overset {\scriptstyle {\rightarrow }}{\alpha \,}}={\overset {\scriptstyle {\rightarrow }}{\beta \,}}=ab={\overset {\scriptstyle {\leftarrow }}{\beta }}={\overset {\scriptstyle {\leftarrow }}{\gamma }}}$, but ${\displaystyle {\overset {\scriptstyle {\rightarrow }}{\gamma \,}}=b}$ and ${\displaystyle {\overset {\scriptstyle {\leftarrow }}{\alpha }}=a}$. That being said, while equivalence relations of one-way extensions were formed by some continuous chain of nested prefixes or suffixes, bidirectional extensions equivalence relations are more complex and the only thing one may conclude for sure is that strings with the same two-way extension are substrings of the longest string having the same two-way extension, but it may even happen that they don't have any non-empty substring in common. The total number of equivalence classes for this relation does not exceed ${\displaystyle n+1}$ which implies that compacted suffix automaton of the string having length ${\displaystyle n}$ has at most ${\displaystyle n+1}$ states. The amount of transitions in such automaton is at most ${\displaystyle 2n-2}$.

Suffix automaton of several strings

Consider a set of words ${\displaystyle T=\{S_{1},S_{2},\dots ,S_{k}\}}$. It is possible to construct a generalization of suffix automaton that would recognize the language formed up by suffixes of all words from the set. Constraints for the number of states and transitions in such automaton would stay the same as for a single-word automaton if you put ${\displaystyle n=|S_{1}|+|S_{2}|+\dots +|S_{k}|}$. The algorithm is similar to the construction of single-word automaton except instead of ${\displaystyle last}$ state, function add_letter would work with the state corresponding to the word ${\displaystyle \omega _{i}}$ assuming the transition from the set of words ${\displaystyle \{\omega _{1},\dots ,\omega _{i},\dots ,\omega _{k}\}}$ to the set ${\displaystyle \{\omega _{1},\dots ,\omega _{i}x,\dots ,\omega _{k}\}}$.

This idea is further generalized to the case when ${\displaystyle T}$ is not given explicitly but instead is given by a prefix tree with ${\displaystyle Q}$ vertices. Mohri et al. showed such an automaton would have at most ${\displaystyle 2Q-2}$ and may be constructed in linear time from its size. At the same time, the number of transitions in such automaton may reach ${\displaystyle O(Q|\Sigma |)}$, for example for the set of words ${\displaystyle T=\{\sigma _{1},a\sigma _{1},a^{2}\sigma _{1},\dots ,a^{n}\sigma _{1},a^{n}\sigma _{2},\dots ,a^{n}\sigma _{k}\}}$ over the alphabet ${\displaystyle \Sigma =\{a,\sigma _{1},\dots ,\sigma _{k}\}}$ the total length of words is equal to ${\textstyle O(n^{2}+nk)}$, the number of vertices in corresponding suffix trie is equal to ${\displaystyle O(n+k)}$ and corresponding suffix automaton is formed of ${\displaystyle O(n+k)}$ states and ${\displaystyle O(nk)}$ transitions. Algorithm suggested by Mohri mainly repeats the generic algorithm for building automaton of several strings but instead of growing words one by one, it traverses the trie in a breadth-first search order and append new characters as it meet them in the traversal, which guarantees amortized linear complexity.

Sliding window

Some compression algorithms, such as LZ77 and RLE may benefit from storing suffix automaton or similar structure not for the whole string but for only last ${\displaystyle k}$ its characters while the string is updated. This is because compressing data is usually expressively large and using ${\displaystyle O(n)}$ memory is undesirable. In 1985, Janet Blumer developed an algorithm to maintain a suffix automaton on a sliding window of size ${\displaystyle k}$ in ${\displaystyle O(nk)}$ worst-case and ${\displaystyle O(n\log k)}$ on average, assuming characters are distributed independently and uniformly. She also showed ${\displaystyle O(nk)}$ complexity cannot be improved: if one considers words construed as a concatenation of several ${\displaystyle (ab)^{m}c(ab)^{m}d}$ words, where ${\displaystyle k=6m+2}$, then the number of states for the window of size ${\displaystyle k}$ would frequently change with jumps of order ${\displaystyle m}$, which renders even theoretical improvement of ${\displaystyle O(nk)}$ for regular suffix automata impossible.

The same should be true for the suffix tree because its vertices correspond to states of the suffix automaton of the reversed string but this problem may be resolved by not explicitly storing every vertex corresponding to the suffix of the whole string, thus only storing vertices with at least two out-going edges. A variation of McCreight's suffix tree construction algorithm for this task was suggested in 1989 by Edward Fiala and Daniel Greene; several years later a similar result was obtained with the variation of Ukkonen's algorithm by Jesper Larsson. The existence of such an algorithm, for compacted suffix automaton that absorbs some properties of both suffix trees and suffix automata, was an open question for a long time until it was discovered by Martin Senft and Tomasz Dvorak in 2008, that it is impossible if the alphabet's size is at least two.

One way to overcome this obstacle is to allow window width to vary a bit while staying ${\displaystyle O(k)}$. It may be achieved by an approximate algorithm suggested by Inenaga et al. in 2004. The window for which suffix automaton is built in this algorithm is not guaranteed to be of length ${\displaystyle k}$ but it is guaranteed to be at least ${\displaystyle k}$ and at most ${\displaystyle 2k+1}$ while providing linear overall complexity of the algorithm.

Applications

Suffix automaton of the string ${\displaystyle S}$ may be used to solve such problems as:

• Counting the number of distinct substrings of ${\displaystyle S}$ in ${\displaystyle O(|S|)}$ on-line,
• Finding the longest substring of ${\displaystyle S}$ occurring at least twice in ${\displaystyle O(|S|)}$,
• Finding the longest common substring of ${\displaystyle S}$ and ${\displaystyle T}$ in ${\displaystyle O(|T|)}$,
• Counting the number of occurrences of ${\displaystyle T}$ in ${\displaystyle S}$ in ${\displaystyle O(|T|)}$,
• Finding all occurrences of ${\displaystyle T}$ in ${\displaystyle S}$ in ${\displaystyle O(|T|+k)}$, where ${\displaystyle k}$ is the number of occurrences.

It is assumed here that ${\displaystyle T}$ is given on the input after suffix automaton of ${\displaystyle S}$ is constructed.

Suffix automata are also used in data compression, music retrieval and matching on genome sequences.

References

1. ^ Crochemore & Vérin (1997), p. 192
2. ^ Weiner (1973)
3. Pratt (1973)
4. Slisenko (1983)
5. Blumer et al. (1984), p. 109
6. Chen & Seiferas (1985), p. 97
7. ^ Blumer et al. (1987), p. 578
8. ^ Inenaga et al. (2001), p. 1
9. ^ Crochemore & Hancart (1997), pp. 3–6
10. ^ Serebryakov et al. (2006), pp. 50–54
11. Рубцов (2019), pp. 89–94
12. Hopcroft & Ullman (1979), pp. 65–68
13. ^ Blumer et al. (1984), pp. 111–114
14. ^ Crochemore & Hancart (1997), pp. 27–31
15. ^ Inenaga et al. (2005), pp. 159–162
16. Rubinchik & Shur (2018), pp. 1–2
17. Inenaga et al. (2005), pp. 156–158
18. ^ Fujishige et al. (2016), pp. 1–3
19. ^ Crochemore & Hancart (1997), pp. 31–36
20. Паращенко (2007), pp. 19–22
21. Blumer (1987), p. 451
22. Inenaga (2003), p. 1
23. ^ Blumer et al. (1987), pp. 585–588
24. Blumer et al. (1987), pp. 588–589
25. Blumer et al. (1987), p. 593
26. Mohri, Moreno & Weinstein (2009), pp. 3558–3560
27. Blumer (1987), pp. 461–465
28. Fiala & Greene (1989), p. 490
29. Larsson (1996)
30. Brodnik & Jekovec (2018), p. 1
31. Senft & Dvořák (2008), p. 109
32. Inenaga et al. (2004)
33. ^ Crochemore & Hancart (1997), pp. 36–39
34. Crochemore & Hancart (1997), pp. 39–41
35. Yamamoto et al. (2014), p. 675
36. Crochemore et al. (2003), p. 211
37. Mohri, Moreno & Weinstein (2009), p. 3553
38. Faro (2016), p. 145

Bibliography

• Blumer, A.; Blumer, J.; Ehrenfeucht, A.; Haussler, D.; McConnell, R. (1984). "Building the minimal DFA for the set of all subwords of a word on-line in linear time". Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 172. pp. 109–118. doi:10.1007/3-540-13345-3_9. ISBN 978-3-540-13345-2.
• Blumer, A.; Blumer, J.; Haussler, D.; McConnell, R.; Ehrenfeucht, A. (1987). "Complete inverted files for efficient text retrieval and analysis". Journal of the ACM. 34 (3): 578–595. doi:10.1145/28869.28873. Zbl 1433.68118.
• Blumer, Janet A. (1987). "How much is that DAWG in the window? A moving window algorithm for the directed acyclic word graph". Journal of Algorithms. 8 (4): 451–469. doi:10.1016/0196-6774(87)90045-9. Zbl 0636.68109.
• Brodnik, Andrej; Jekovec, Matevž (2018). "Sliding Suffix Tree". Algorithms. 11 (8): 118. doi:10.3390/A11080118. Zbl 1458.68043.
• Chen, M. T.; Seiferas, Joel (1985). "Efficient and Elegant Subword-Tree Construction". Combinatorial Algorithms on Words. pp. 97–107. doi:10.1007/978-3-642-82456-2_7. ISBN 978-3-642-82458-6.
• Crochemore, Maxime; Hancart, Christophe (1997). "Automata for Matching Patterns". Handbook of Formal Languages. pp. 399–462. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-08230-6.
• Crochemore, Maxime; Vérin, Renaud (1997). "On compact directed acyclic word graphs". Structures in Logic and Computer Science. Lecture Notes in Computer Science. Vol. 1261. pp. 192–211. doi:10.1007/3-540-63246-8_12. ISBN 978-3-540-63246-7.
• Crochemore, Maxime; Iliopoulos, Costas S.; Navarro, Gonzalo; Pinzon, Yoan J. (2003). "A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval". String Processing and Information Retrieval. Lecture Notes in Computer Science. Vol. 2857. pp. 211–223. doi:10.1007/978-3-540-39984-1_16. ISBN 978-3-540-20177-9.
• Serebryakov, Vladimir; Galochkin, Maksim Pavlovich; Furugian, Meran Gabibullaevich; Gonchar, Dmitriy Ruslanovich (2006). Теория и реализация языков программирования: Учебное пособие (PDF) (in Russian). Moscow: MZ Press. ISBN 5-94073-094-9.
• Faro, Simone (2016). "Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences". Algorithms for Computational Biology. Lecture Notes in Computer Science. Vol. 9702. pp. 145–157. doi:10.1007/978-3-319-38827-4_12. ISBN 978-3-319-38826-7.
• Fiala, E. R.; Greene, D. H. (1989). "Data compression with finite windows". Communications of the ACM. 32 (4): 490–505. doi:10.1145/63334.63341.
• Fujishige, Yuta; Tsujimaru, Yuki; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki (2016). "Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets". 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 38:1–38:14. doi:10.4230/LIPICS.MFCS.2016.38. Zbl 1398.68703.
• Hopcroft, John Edward; Ullman, Jeffrey David (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Massachusetts: Addison-Wesley. ISBN 978-81-7808-347-6. OL 9082218M.
• Inenaga, Shunsuke (2003). "Bidirectional Construction of Suffix Trees" (PDF). Nordic Journal of Computing. 10 (1): 52–67. CiteSeerX 10.1.1.100.8726.
• Inenaga, Shunsuke; Hoshino, Hiromasa; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo; Mauri, Giancarlo; Pavesi, Giulio (2005). "On-line construction of compact directed acyclic word graphs". Discrete Applied Mathematics. 146 (2): 156–179. doi:10.1016/J.DAM.2004.04.012. Zbl 1084.68137.
• Inenaga, Shunsuke; Hoshino, Hiromasa; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo (2001). "Construction of the CDAWG for a trie" (PDF). Prague Stringology Conference. Proceedings. pp. 37–48. CiteSeerX 10.1.1.24.2637.
• Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo (2004). "Compact directed acyclic word graphs for a sliding window". Journal of Discrete Algorithms. 2: 33–51. doi:10.1016/S1570-8667(03)00064-9. Zbl 1118.68755.
• Larsson, N.J. (1996). "Extended application of suffix trees to data compression". Proceedings of Data Compression Conference - DCC '96. pp. 190–199. doi:10.1109/DCC.1996.488324. ISBN 0-8186-7358-3.
• Mohri, Mehryar; Moreno, Pedro; Weinstein, Eugene (2009). "General suffix automaton construction algorithm and space bounds". Theoretical Computer Science. 410 (37): 3553–3562. doi:10.1016/J.TCS.2009.03.034. Zbl 1194.68143.
• Паращенко, Дмитрий А. (2007). Обработка строк на основе суффиксных автоматов (PDF) (in Russian). Saint Petersburg: ITMO University.
• Pratt, Vaughan Ronald (1973). Improvements and applications for the Weiner repetition finder. OCLC 726598262.
• Рубцов, Александр Александрович (2019). Заметки и задачи о регулярных языках и конечных автоматах (PDF) (in Russian). Moscow: Moscow Institute of Physics and Technology. ISBN 978-5-7417-0702-9.
• Rubinchik, Mikhail; Shur, Arseny M. (2018). "EERTREE: An efficient data structure for processing palindromes in strings". European Journal of Combinatorics. 68: 249–265. arXiv:1506.04862. doi:10.1016/J.EJC.2017.07.021. Zbl 1374.68131.
• Senft, Martin; Dvořák, Tomáš (2008). "Sliding CDAWG Perfection". String Processing and Information Retrieval. Lecture Notes in Computer Science. Vol. 5280. pp. 109–120. doi:10.1007/978-3-540-89097-3_12. ISBN 978-3-540-89096-6.
• Slisenko, A. O. (1983). "Detection of periodicities and string-matching in real time". Journal of Soviet Mathematics. 22 (3): 1316–1387. doi:10.1007/BF01084395. Zbl 0509.68043.
• Weiner, Peter (1973). "Linear pattern matching algorithms". 14th Annual Symposium on Switching and Automata Theory (Swat 1973). pp. 1–11. doi:10.1109/SWAT.1973.13.
• Yamamoto, Jun'ichi; I, Tomohiro; Bannai, Hideo; Inenaga, Shunsuke; Takeda, Masayuki (2014). "Faster Compact On-Line Lempel-Ziv Factorization". 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 675–686. doi:10.4230/LIPICS.STACS.2014.675. Zbl 1359.68341.

External links

• Media related to Suffix automaton at Wikimedia Commons
• Suffix automaton article on E-Maxx Algorithms in English

• Finite automata
• Substring indices