On the decomposition of prefix codes

DOI10.1016/J.TCS.2015.12.002zbMATH Open1362.68135OpenAlexW2213478162MaRDI QIDQ517038FDOQ517038

Authors: Clelia De Felice, Sabrina Mantaci, Antonio Restivo 

Publication date: 16 March 2017

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.002

Recommendations

• Publication:4332299
• A three-word code which is not prefix-suffix composed
• Decompositions of recognizable strong maximal codes
• scientific article; zbMATH DE number 176765
• scientific article; zbMATH DE number 2032371

zbMATH Keywords

finite automatarational languagesprefix codescomposition of codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• Sur le théorème du defaut
• Codes and automata.
• Compositions of maximal codes
• Groups and decompositions of codes
• Recent results on syntactic groups of prefix codes.
• On the synchronizing properties of certain prefix codes
• Variants of codes and indecomposable languages
• On codes having no finite completions
• On the lattice of prefix codes.
• On the existence of prime decompositions

Cited In (20)

• Title not available (Why is that?)
• On the size of transducers for bidirectional decoding of prefix codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the lattice of prefix codes.
• A note on r-extensible prefix codes
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• Groups and decompositions of codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity aspects of guessing prefix codes
• Prime Decomposition Problem for Several Kinds of Regular Codes
• Efficient and compact representations of some non-canonical prefix-free codes
• Fast and Compact Prefix Codes
• Congruences, infix and cohesive prefix codes
• Title not available (Why is that?)

This page was built for publication: On the decomposition of prefix codes

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