Abstract
By means of further investigation of solid codes, the problem “Is every fd-domain uniformly dense” proposed by Yuqi Guo, C. M. Reis and G. Thierrin in 1988 is solved in this paper.
Similar content being viewed by others
References
Reis C M, Shyr H J. Some properties of disjunctive languages on a free monoid. Inform and Contr, 37(3): 334–344 (1978)
Guo Y Q, Shyr H J, Thierrin G. F-disjunctive languages. Int J Comput Math, 18: 219–237 (1986)
Reis C M. A note on f-disjunctive languages. Semigroup Forum, 36: 159–165 (1987)
Guo Y Q, Reis C M, Thierrin G. Relatively f-disjunctive languages. Semigroup Forum, 37: 289–299 (1988)
Guo Y Q, Reis C M, Thierrin G. Fd-domains and rf-disjunctive languages. Chin Sci Bull, 34(5): 356–360 (1989)
Jiang Z H. On strong dense languages and an equivalent description of the GRT problem. Acta Math Sin, Chinese Series, 32(3): 307–315 (1989)
Berstel J, Perrin D. Theory of Codes. Orlando: Academic Press, 1985
Shyr H J. Free Monoids and Languages, 3rd ed. Taichung: Hon Min Book Company, 2001
Shyr H J, Yu S S. Solid codes and disjunctive domains. Semigroup Forum, 41(1): 23–37 (1990)
Jürgensen H, Konstantinidis S. Codes. In: Rozerberg G, Salomaa A, eds. Handbook of Formal Languages, Vol 1. Berlin-Heidelberg: Springer-Verlag, 1997, 511–607
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the National Natural Science Foundation of China (Grant No. 10471112) and the Educational Committee Foundation (ECF) of Yunnan Province of China (Grant No. 04Y583A)
Rights and permissions
About this article
Cite this article
Liu, Y., Guo, Yq. & Tsai, YS. Solid codes and the uniform density of fd-domains. SCI CHINA SER A 50, 1026–1034 (2007). https://doi.org/10.1007/s11425-007-0051-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11425-007-0051-2