On the decomposition of prefix codes

DOI10.1016/j.tcs.2015.12.002zbMath1362.68135OpenAlexW2213478162MaRDI QIDQ517038

Sabrina Mantaci, Clelia De Felice, 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

zbMATH Keywords

finite automataprefix codesrational languagescomposition of codes

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Groups and decompositions of codes
• Recent results on syntactic groups of prefix codes.
• On the existence of prime decompositions
• Variants of codes and indecomposable languages
• Compositions of maximal codes
• Sur le théorème du defaut
• On codes having no finite completions
• On the lattice of prefix codes.
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• On the synchronizing properties of certain prefix codes

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