A note on r-extensible prefix codes

DOI10.1007/BF02573310MaRDI QIDQ1114025zbMATH OpenFDO

Authors Shuhua Zhang

Publication date 1989

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/134999

zbMATH Keywords

cs-prime idealsr-extensible prefix code

Mathematics Subject Classification ID

Ideal theory for semigroups (20M12) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Review text

A prefix code P over X is said to be r-extensible if for every uv\(\in P\) and \(x\in X^*\) there exists \(s\in X^*\) such that \(uxv=ts\) for some \(t\in P\). An ideal I of \(X^*\) is said to be cs-prime if \(x^ 2\in I\) implies that \(x\in I\). In this note, a necessary and sufficient condition for an r-extensible prefix code to be finite is given. The class of all r-extensible prefix codes generating cs-prime ideals is constructed.

Recommendations

• scientific article; zbMATH DE number 4145828
• On the decomposition of prefix codes
• Strongly prefix codes and the generalized Raney formula
• scientific article; zbMATH DE number 3910298
• scientific article; zbMATH DE number 2032371
• A note on the construction of error detecting/correcting prefix codes
• Publication:3028876
• Bounding the inefficiency of length-restricted prefix codes
• Some remarks on prefix and suffix codes

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 4078833 (Why is no real title available?)
• Hypercodes, Right Convex Languages and their Syntactic Monoids
• Semaphore Codes and Ideals

Cited in

(1)

• Necessary and sufficient conditions of commutatively prefix codes and every-layer-extensible codes

This page was built for publication: A note on r-extensible prefix codes

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