Finite biprefix sets of paths in a graph
From MaRDI portal
Publication:1105386
DOI10.1016/0304-3975(88)90021-7zbMath0648.68081MaRDI 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
finiteness; biprefix codes; biprefix sets of paths; Césari-Schützenberger algorithm; codes of paths in a graph; double-infinite paths
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
94A45: Prefix, length-variable, comma-free codes
Related Items
Cites Work