Prime Decomposition Problem for Several Kinds of Regular Codes

DOI10.1007/11921240_15zbMATH Open1168.68418OpenAlexW2116237230MaRDI QIDQ3525151FDOQ3525151

Authors: Kieu Van Hung, Do Long Van 

Publication date: 11 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11921240_15

Recommendations

• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• scientific article; zbMATH DE number 1962770
• Length Codes, Products of Languages and Primality
• Variants of codes and indecomposable languages
• On the decomposition of prefix codes

zbMATH Keywords

codeinvariant relationprime decomposition problem

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Codes induced by alternative codes
• Intercode regular languages
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES

This page was built for publication: Prime Decomposition Problem for Several Kinds of Regular Codes

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