Finite biprefix sets of paths in a graph (Q1105386): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4430300 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994777 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sur un algorithme donnant les codes bipréfixes finis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3853827 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Completing biprefix codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ensembles libres de chemins dans un graphe / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Special Class of Recurrent Events / rank | |||
Normal rank | |||
Latest revision as of 17:01, 18 June 2024
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
