32
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Two classes of languages related to the prefix codes

Pages 1-7 | Received 02 Jan 2003, Accepted 22 Jan 2003, Published online: 08 Jun 2010
 

Abstract

In this paper, we generalize some properties about prefix codes in Citation[1], replacing the condition: the language L is finite with the condition: L satisfies |∪ x∈η(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 ⟨M, ·⟩ an equivalent description.

Acknowledgement

The authors would like to thank Cao Chunhua and Liu Yun for their valuable suggestions. The project is supported by NSF(10071068) of China.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.