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

biprefix codesformal power series

Mathematics Subject Classification ID

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

Review text

This short and well-written paper shows that each finite biprefix code can be extended to a recognizable maximal biprefix code. To obtain this result the author proves some other interesting facts for biprefix codes in terms of formal power series.

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

• A remark on incompletely specified automata
• Codes asynchrones
• Each regular code is included in a maximal regular code
• 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?)
• On a Special Class of Recurrent Events

Cited in

(17)

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

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)