Finite biprefix sets of paths in a graph

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

finitenessbiprefix codesbiprefix sets of pathscodes of paths in a graphdouble-infinite pathsCésari-Schützenberger algorithm

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)

Recommendations

• scientific article; zbMATH DE number 3961504
• On the degree of finite maximal biprefix codes
• Publication:3476744
• Completing biprefix codes
• scientific article; zbMATH DE number 3943051

Cites work

• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• Completing biprefix codes
• Ensembles libres de chemins dans un graphe
• On a Special Class of Recurrent Events
• Sur un algorithme donnant les codes bipréfixes finis

Cited in

(4)

• Ensembles libres de chemins dans un graphe
• Bifix codes and Sturmian words
• Codes and sofic constraints
• scientific article; zbMATH DE number 3961504 (Why is no real title available?)

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)