Finite biprefix sets of paths in a graph (Q1105386)

From MaRDI portal
Revision as of 17:01, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finite biprefix sets of paths in a graph
scientific article

    Statements

    Finite biprefix sets of paths in a graph (English)
    0 references
    1988
    0 references
    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.
    0 references
    biprefix sets of paths
    0 references
    biprefix codes
    0 references
    codes of paths in a graph
    0 references
    double-infinite paths
    0 references
    finiteness
    0 references
    Césari-Schützenberger algorithm
    0 references
    0 references

    Identifiers