Talk:Suffix automaton

CSB tag removed
I removed

because recognized the article as a copy of itself. Bug report here. Q VVERTYVS (hm?) 20:34, 7 October 2014 (UTC)

Merge suffix automaton and directed acyclic word graph
Suffix automaton and directed acyclic word graph are same things. --Abionab (talk) 04:05, 1 November 2015 (UTC)

Minimality of the automaton.
The article didn't require the automaton to be minimal and deterministic. I added that requirement, because it is how the suffix automaton is usually defined in the literature. See e.g. the well-cited papers:

Blumer, Anselm, et al. "The smallest automation recognizing the subwords of a text." Theoretical computer science 40 (1985): 31-55.

Ukkonen, Esko. "On-line construction of suffix trees." Algorithmica 14.3 (1995): 249-260.

I also defined DAWG to be the state graph of the suffix automaton without designated accepting or rejecting states as in Blumer's paper.

Rewrite
I expanded and rewrote the article. I hope everything is correct. — Preceding unsigned comment added by Jnalanko (talk • contribs) 07:45, 23 June 2018 (UTC)

Another rewrite
Hi there! I'm the author of the featured article Суффиксный автомат about this subject in Russian Wikipedia. I'm currently working on its translation and want to merge it with current version. Work in progress is here, feel free to leave any comments and/or suggestions. adamant.pwn — contrib/talk 03:02, 2 September 2020 (UTC)