Completing biprefix codes

DOI10.1016/0304-3975(83)90028-2MaRDI QIDQ790624zbMATH OpenOpenAlexFDO

Authors Dominique Perrin

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0304-3975(83)90028-2

zbMATH Keywords

formal power seriesbiprefix codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Completion of recognizable bifix codes
• A property of biprefix codes
• On the degree of finite maximal biprefix codes
• Finite Completion of comma-free codes Part 1
• scientific article; zbMATH DE number 4092795

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 3606368 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• A remark on incompletely specified automata
• Codes asynchrones
• Each regular code is included in a maximal regular code
• On a Special Class of Recurrent Events

Cited in

(15)

• An application of Hajós factorizations to variable-length codes
• Finite biprefix sets of paths in a graph
• scientific article; zbMATH DE number 1972782 (Why is no real title available?)
• Completion of codes with finite bi-decoding delays.
• On maximal codes with bounded synchronization delay
• A completion algorithm for codes with bounded synchronization delay
• Maximal bifix codes
• Completing codes
• Completing comma-free codes
• A property of biprefix codes
• Completion of \(d\)-\(L\) prefix codes
• Generalizations of Code Languages with Marginal Errors
• scientific article; zbMATH DE number 3961504 (Why is no real title available?)
• Finite maximal solid codes
• The completion of very thin prefix codes with degree \(n\)

This page was built for publication: Completing biprefix codes

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