Completing biprefix codes

DOI10.1016/0304-3975(83)90028-2zbMATH Open0534.68052OpenAlexW2083135460MaRDI QIDQ790624FDOQ790624

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

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 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Each regular code is included in a maximal regular code
• A remark on incompletely specified automata
• On a Special Class of Recurrent Events
• Codes asynchrones
• Title not available (Why is that?)

Cited In (14)

• An application of Hajós factorizations to variable-length codes
• Finite biprefix sets of paths in a graph
• Title not available (Why is that?)
• Completion of codes with finite bi-decoding delays.
• A completion algorithm for codes with bounded synchronization delay
• On maximal codes with bounded synchronization delay
• Maximal bifix codes
• Completing codes
• Completing comma-free codes
• A property of biprefix codes
• Generalizations of Code Languages with Marginal Errors
• Title not available (Why is that?)
• 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)