Abstract:
The authors have developed a software package “BruijnViz” intended for researching properties of unlimited word chains. All the subwords of length $n$ taken from a symbol sequence are depicted on de Bruijn graph. The graph of subwords is named the graph-portrait of the sequence. The set of the graph-portraits of a word chain constructed for $n=1,2,3,\dots$ characterizes the chain: its periodicity, length and number of repetitions of subwords, variety of subwords, their structure, etc. The package represents each graph-portrait of a word chain during its growth. The graph-portraits of many known mathematical chains and of the word chains originated in different applications are presented in the paper.