TWO CLASSES OF LANGUAGES RELATED TO THE PREFIX CODES

摘要

In this paper, we generalize some properties about prefix codes in [1], replacing the condition: the language L is finite with the condition: L satisfies |∪_(χ∈η(L) x~(-1) L| < ∞. Then we give another equivalent characterization on the right dense. At last, we give the element in an ideal K = [A ∈ M| AM ∩ P = φ} of an equivalent description.