Coding Partitions: Regularity, Maximality and Global Ambiguity

DOI10.1007/978-3-540-73208-2_8MaRDI QIDQ5428219zbMATH OpenOpenAlexFDO

Authors Marie-Pierre Béal, Fabio Burderi, Antonio Restivo

Publication date 28 November 2007

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73208-2_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Coding partitions of regular sets
• Coding partitions
• The finest homophonic partition and related code concepts
• Maximal codes with bounded deciphering delay
• The finest homophonic partition and related code concepts

Cited in

(6)

• Coding partitions of regular sets
• Regular universal codeword sets (Corresp.)
• The finest homophonic partition and related code concepts
• The finest homophonic partition and related code concepts
• Coding partitions
• The coding power of a product of partitions

This page was built for publication: Coding Partitions: Regularity, Maximality and Global Ambiguity

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