Finite biprefix sets of paths in a graph
The main results of the combinatorial theory of maximal biprefix codes of words (Césari, Perrin, Schützenberger) are extended to the codes of paths in a graph: degree and decoding of double-infinite paths, finiteness of codes of a given degree, the Césari-Schützenberger algorithm, derivation and integration of codes will be discussed.
scientific article; zbMATH DE number 4058889