Suffix Automaton

Правка en2, от 3905, 2015-06-10 16:16:59

Can someone please explain the suffix automaton algorithm as I have read from all possible sources but still no clue. And also what does this algorithm give (I mean like in suffix array it is sorted suffixes of string).Also is Finite Automata same as suffix automaton.If no please can you mention the purpose of FA. I understood its algorithm but _ am unable to get its intuition and the purpose it's used.If someone can explain, I'll be highly obliged._ I know this is lot of work to explain but you can downvote the post if you like but please explain. Thanx .

Теги suffix automata

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский 3905 2015-06-10 16:16:59 138
en1 Английский 3905 2015-06-10 05:12:31 443 Initial revision (published)