A toolkit for graphical analysis of word chains
Prikladnaâ diskretnaâ matematika, no. 1 (2008), pp. 108-110
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
@article{PDM_2008_1_a16,
author = {A. A. Evdokimov and A. A. Levin},
title = {A toolkit for graphical analysis of word chains},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {108--110},
year = {2008},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2008_1_a16/}
}
A. A. Evdokimov; A. A. Levin. A toolkit for graphical analysis of word chains. Prikladnaâ diskretnaâ matematika, no. 1 (2008), pp. 108-110. http://geodesic.mathdoc.fr/item/PDM_2008_1_a16/