Lattice Derived by Double Indiscernibility and Computational Complementarity

  • Authors:

  • Yukio-Pegio Gunji;Taichi Haruna;Eugene Schneider Kitamura

  • Affiliations:

  • Department of Earth & Planetary Sciences, Faculty of Science, Kobe University, Nada Kobe, Japan 657-8501;Department of Earth & Planetary Sciences, Faculty of Science, Kobe University, Nada Kobe, Japan 657-8501;Department of Earth & Planetary Sciences, Faculty of Science, Kobe University, Nada Kobe, Japan 657-8501

  • Venue:
  • RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.