Finite biprefix sets of paths in a graph
From MaRDI portal
Publication:1105386
DOI10.1016/0304-3975(88)90021-7zbMath0648.68081OpenAlexW2008639871MaRDI QIDQ1105386
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
finitenessbiprefix codesbiprefix sets of pathsCésari-Schützenberger algorithmcodes of paths in a graphdouble-infinite paths
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Prefix, length-variable, comma-free codes (94A45)
Related Items (2)
Cites Work
This page was built for publication: Finite biprefix sets of paths in a graph