Doubt in Building an automaton according to the prefix function(Cp-algorithms)

Revision en2, by OverKiller, 2020-05-22 09:24:22

Recently, i was learning kmp(from cp-algorithms) and in it's application last part was Building an automaton according to the prefix function link to article.
I am having hard time understanding what aut[i][c] stores here and how can we use it to find longest suffix which is also a prefix of text by adding character c at position i. I tried printing the values stored in aut[i][c] and the corresponding substring but couldn't understand what do they store?
Any help or example to demonstrate this would be much appreciated.
Thanks in advance.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English OverKiller 2020-05-22 09:24:22 126
en1 English OverKiller 2020-05-22 09:22:17 589 Initial revision (published)