Finite biprefix sets of paths in a graph
type: Item
instance of: scholarly article
title: Finite biprefix sets of paths in a graph
zbMATH Open document ID: 0648.68081
DOI: 10.1016/0304-3975(88)90021-7
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 4058889
zbMATH Keywords: biprefix sets of paths
zbMATH Keywords: biprefix codes
zbMATH Keywords: codes of paths in a graph
zbMATH Keywords: double-infinite paths
zbMATH Keywords: finiteness
zbMATH Keywords: Césari-Schützenberger algorithm
author: Clelia De Felice
MaRDI profile type: Publication
full work available at URL: 0304-3975(88)90021-7
OpenAlex ID: W2008639871
cites work: Q4430300
cites work: Q3994777
cites work: Sur un algorithme donnant les codes bipréfixes finis
cites work: Q3853827
cites work: Completing biprefix codes
cites work: Ensembles libres de chemins dans un graphe
cites work: On a Special Class of Recurrent Events
description: scientific article; zbMATH DE number 4058889