Lattice derived by double indiscernibility and computational complementarity

Yukio Pegio Gunji, Taichi Haruna, Eugene Schneider Kitamura

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

We here concentrate on equivalence relation, and show that the composition of upper approximation of one equivalence relation and the lower one of the other equivalence relation can form a lattice. We also show that this method can be used to define computational complementarity in automata.

本文言語English
ホスト出版物のタイトルRough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings
ページ46-51
ページ数6
DOI
出版ステータスPublished - 2009 8 27
外部発表はい
イベント4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009 - Gold Coast, QLD, Australia
継続期間: 2009 7 142009 7 16

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5589 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
CountryAustralia
CityGold Coast, QLD
Period09/7/1409/7/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Lattice derived by double indiscernibility and computational complementarity」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル