The Lower and Upper Approximations of Language Based on String Indiscernibility Relation-The application of rough set

Tian Yun ZHI;Duo Qian MIAO

Systems Engineering - Theory & Practice ›› 2002, Vol. 22 ›› Issue (1) : 79-82.

PDF(173 KB)
中国科学院数学与系统科学研究院期刊网
PDF(173 KB)
Systems Engineering - Theory & Practice ›› 2002, Vol. 22 ›› Issue (1) : 79-82. DOI: 10.12011/1000-6788(2002)1-79
论文

The Lower and Upper Approximations of Language Based on String Indiscernibility Relation-The application of rough set

  • Tian Yun ZHI(1),Duo Qian MIAO(2)
Author information +
History +

Abstract

This paper expounds five string indiscernibility relation(equivalence relation or tolerance relation) and obtains the upper and the lower approximations of language. By vering the length of the substring, we get approximate sequ-ences of approximations converging to the language. At last instructing the upper and the lower approximations of language by an example.

Key words

Rough Set / string / indiscernibility relation / upper approximation / lower approximation

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
Tian Yun ZHI , Duo Qian MIAO. The Lower and Upper Approximations of Language Based on String Indiscernibility Relation-The application of rough set. Systems Engineering - Theory & Practice, 2002, 22(1): 79-82 https://doi.org/10.12011/1000-6788(2002)1-79
PDF(173 KB)

313

Accesses

0

Citation

Detail
Sections
Recommended

/

〈 〉