Question about suffix automaton/tree

Revision en1, by adamant, 2016-07-16 13:32:04

Hi everyone!

As you may know, it is possible to build a suffix automaton for a set of strings as well as suffix tree consisting of all suffixes of strings from the set. Question is as follows: for each string Sk consider set Vk of vertices/states of tree/automaton that corresponds to the substrings of Sk. Is it true that ? Can you prove it or make a counter-example?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English adamant 2016-07-16 13:32:04 479 Initial revision (published)