Finite biprefix sets of paths in a graph (Q1105386)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4058889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite biprefix sets of paths in a graph |
scientific article; zbMATH DE number 4058889 |
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.816692590713501
0 references
0.7948414087295532
0 references
