Completing biprefix codes

DOI10.1016/0304-3975(83)90028-2zbMath0534.68052OpenAlexW2083135460MaRDI QIDQ790624

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) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (8)

Finite biprefix sets of paths in a graph ⋮ A completion algorithm for codes with bounded synchronization delay ⋮ Completing comma-free codes ⋮ An application of Hajós factorizations to variable-length codes ⋮ Finite maximal solid codes ⋮ Generalizations of Code Languages with Marginal Errors ⋮ On maximal codes with bounded synchronization delay ⋮ Maximal bifix codes

Cites Work

• Each regular code is included in a maximal regular code
• Codes asynchrones
• A remark on incompletely specified automata
• On a Special Class of Recurrent Events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completing biprefix codes