Finite biprefix sets of paths in a graph

From MaRDI portal

DOI10.1016/0304-3975(88)90021-7MaRDI QIDQ1105386zbMATH OpenOpenAlexFDO

Authors Clelia De Felice

Publication date 1988

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(88)90021-7


zbMATH Keywords

biprefix codesbiprefix sets of pathscodes of paths in a graphCésari-Schützenberger algorithmdouble-infinite pathsfiniteness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Prefix, length-variable, comma-free codes (94A45)




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.


Recommendations


Cites work


Cited in
(5)








This page was built for publication: Finite biprefix sets of paths in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105386)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Finite_biprefix_sets_of_paths_in_a_graph&oldid=69653655"
Powered by MediaWiki